Encoding

Problem Description

Given a string containing only 'A' - 'Z', we could encode it using the following method: 

1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.

2. If the length of the sub-string is 1, '1' should be ignored.

 

Input

The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.

 

Output

For each test case, output the encoded string in a line.

 

Sample Input

  
  

   
   2
ABC
ABBCCC
  
  

 

Sample Output

  
  

   
   ABC
A2B3C
  
  

#include<string.h>
#include<stdio.h>
char c[10001];
int m,n,t,i,j;
int main()
{
    scanf("%d",&t);
    while(t--)
    {
    scanf("%s",c);
    int l=strlen(c);
    int flag;
    int mark=0;
    while(i<l)
    {
        flag=1;
        for(i=mark;i<l;i++)
        {
            if(c[i+1]==c[i])
            flag++;
            else
            {
              if(flag!=1)
                printf("%d%c",flag,c[i]);
              else
                printf("%c",c[i]);
                break;
            }
        }
        mark=i+1;    
    }
    printf("\n");
    }
    return 0;
}