Problem2: Vijay & Ajith

Vijay and Ajith are close friends. They used to send messages to each other. They wanted privacy and so they communicate in a different language which others can’t understand.  Simbu, the hacker learns their language and cracks their messages. Being in the position of Simbu your task is to crack what Vijay and Ajith communicates.

INPUT

The first lines consists of an positive integer t, the number of test cases followed by t lines. Each line consists of two positive integers m and n which denotes the number of lines and the length of their message.

OUTPUT

For each testcase print the message cracked by Mr.Simbu.

Input Speciffications:

1<=t<=100

1<=m<=100

1<=n<=100

Time constraint: 1 second

EXAMPLE

SAMPLE INPUT:

2

5 4

tnse

hrie

eina

ssts

ueht

2 2

bo

ok

SAMPLE OUTPUT:

thesunrisesintheeast

book