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
nachi_w:
20170323 05:59:58
Guys where can i find the test cases??


akibk001:
20170321 21:58:49
thanks dimz01 for the test case 9


sandy1410:
20170321 16:27:13
nice question 

nkumar_1896:
20170319 20:04:20
lovely que. 

arthur1991:
20170319 09:40:56
i love qianqian 

amarjeet_123:
20170314 21:31:13
how can i reduce my runtime 

alexakel:
20170306 10:07:56
Is there effective test cases? How can I check, whether my program works well on this site? It is awful service. CodingGame in such way is more better 

satyamr1:
20170223 14:02:07
How to store such a large number with 1000000 digits? 

primecode:
20170221 08:56:58
#saurabh your last two outputs are wrong. it must be 101 and 1001. 

bansalrajat20:
20170214 19:55:47
why i am getting TLE error 
Added by:  adrian 
Date:  20040501 
Time limit:  2s9s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 