You and your friend have come up with a way to send messages back and
forth.

Your friend can encode a message to you by writing down a positive
integer \(N\) and a symbol. You can
decode that message by writing out that symbol \(N\) times in a row on one line.

Given a message that your friend has encoded, decode it.

The first line of input contains \(L\),
the number of lines in the message.

The next \(L\) lines each contain
one positive integer less than 80, followed by one space, followed by a
(non-space) character.

The output should be \(L\) lines long.
Each line should contain the decoding of the corresponding line of the
input. Specifically, if line \(i+1\) of
the input contained N x, then line \(i\) of the output should contain just the
character x printed
N times.

생성자가 기록되지 않았습니다.

출처 CCC 2019 Junior