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
lunaticgaming:
20190215 04:44:10
Execution Time: .04


deep123r:
20190214 17:14:15
Check for these things


mighty_joe781:
20190212 07:42:13
I am also getting TLE any ideas. 

randm_codr_rs:
20190205 14:15:20
I'm getting runtime error NZEC in this problem while submitting


venom_black:
20190118 14:37:29
too hard 

gjenkinsedu:
20190117 23:43:55
I have written a C version that passes with all test data on SPOJToolkit, and I have hand tested it with numbers of more than 10000 digits and it works fine. but It still fails on SPOJ with wrong results. Any suggestions or places with more extensive test cases 

ashwini_571:
20190115 21:26:34
Last edit: 20190115 21:26:56 

squirrelli:
20190103 14:02:41
If input is 010,000, isn't the output 10,001? 

sehgal_divij:
20190102 13:21:19
runs on my machine but fails here.


nitin_uniyal:
20181223 05:14:36
running time 0.56 s.

Added by:  adrian 
Date:  20040501 
Time limit:  2s9s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 