PALIN  The Next Palindrome
A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. For a given positive integer K of not more than 1000000 digits, write the value of the smallest palindrome larger than K to output. Numbers are always displayed without leading zeros.
Input
The first line contains integer t, the number of test cases. Integers K are given in the next t lines.
Output
For each K, output the smallest palindrome larger than K.
Example
Input: 2 808 2133 Output: 818 2222
Warning: large Input/Output data, be careful with certain languages
hide comments
Bumbler:
20140115 15:17:31
Awesome problem !! 

Junior Prog:
20140115 15:17:31
How to handle large numbers like 100000 digit numbers used here??


Junior Prog:
20140115 15:17:31
Hey can anyone tell me how to work with 100000 digits? I have never come across such a huge number before! 

abdelkarim:
20140115 15:17:31
@problem setter :


DEVANSH PARASHAR:
20140115 15:17:31
omg i forgot to notice its 1000000 digits not 1000000 fish 

Bharath Chandrasekar:
20140115 15:17:31
ok..got it after 7 WA...never underestimate a problem! Last edit: 20121209 05:45:18 

Trần Mạnh Quân:
20140115 15:17:31
It's really hard to have AC in ACM :( 

Jegan:
20140115 15:17:31
it's great... Last edit: 20120803 16:28:32 

garretthh07:
20140115 15:17:31
oh!!I think my methods is ok,but it gets wrong!! 

Udaybhanu Sanyal:
20140115 15:17:31
god knows y my code not working...working fyn in my pc tho... 
Added by:  adrian 
Date:  20040501 
Time limit:  2s9s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 