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
m_rahulkrishna:
20170718 18:46:08
here is my code in java


kotal_kahn:
20170715 18:35:51
hey i am using string to store large numbers then incrementing by 1


m_sundriyal:
20170714 00:00:37
if(problem==TLE) http://www.geeksforgeeks.org/?p=23497


md_hasnain:
20170711 11:52:42
My code is running without any tle in ideone with time limit as 5s but giving tle in spoj...


Kraken:
20170710 03:47:05
Test case of @manmeet_rana works for me


jayu_jd:
20170706 06:54:06
nice problem!! 

manmeet_rana:
20170704 08:02:34
guys consider test cases like 999


azazello_:
20170620 10:49:23
Tips for beginners like me:


azazello_:
20170620 10:07:14
@balaram_tupili


balaram_tupili:
20170617 14:35:31
pls help TLE ...

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