GNY07C - Encoding

Chip and Dale have devised an encryption method to hide their (written) text messages. They first agree secretly on two numbers that will be used as the number of rows (R) and columns (C) in a matrix. The sender encodes an intermediate format using the following rules:

  1. The text is formed with uppercase letters [A-Z] and <space>.
  2. Each text character will be represented by decimal values as follows:

    <space> = 0, A = 1, B = 2, C = 3, ..., Y = 25, Z = 26

The sender enters the 5 digit binary representation of the characters’ values in a spiral pattern along the matrix as shown below. The matrix is padded out with zeroes (0) to fill the matrix completely. For example, if the text to encode is: "ACM" and R=4 and C=4, the matrix would be filled in as follows:

A = 00001, C = 00011, M = 01101
         (one extra 0)

The bits in the matrix are then concatenated together in row major order and sent to the receiver. The example above would be encoded as: 0000110100101100

Input

The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.

Each dataset consists of a single line of input containing R (1<=R<=20), a space, C (1<=C<=20), a space, and a text string consisting of uppercase letters [A-Z] and <space>. The length of the text string is guaranteed to be <= (R*C)/5.

Output

For each dataset, you should generate one line of output with the following values: The dataset number as a decimal integer (start counting at one), a space, and a string of binary digits (R*C) long describing the encoded text. The binary string represents the values used to fill in the matrix in row- major order. You may have to fill out the matrix with zeroes (0) to complete the matrix.

Example

Input:
4
4 4 ACM
5 2 HI
2 6 HI
5 5 HI HO

Output:
1 0000110100101100
2 0110000010
3 010000001001
4 0100001000011010110000010

Added by:Marco Gallotta
Date:2008-03-11
Time limit:14.95s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:ACM Greater New York Regionals 2007

hide comments
2010-06-04 08:42:16 rakesh
HEY iam getting wrong answer during compilation itself... Can somebody help me out..
2010-02-25 04:31:47 N. Karthik Swaminathan
The input has some problems and does not stick to the constrains of 1 <= R <= 20, 1 <= C <= 20.

Edit by sefakilic: 1 <= R <= 21, 1 <= C <= 21

Last edit: 2010-04-25 04:58:00
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.