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


Added by:adrian
Date:2004-05-01
Time limit:2s-9s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6

hide comments
2017-03-23 05:59:58
Guys where can i find the test cases??
its running properly on my IDE but not on submission.
2017-03-21 21:58:49
thanks dimz01 for the test case 9
2017-03-21 16:27:13
nice question
2017-03-19 20:04:20
lovely que.
2017-03-19 09:40:56
i love qianqian
2017-03-14 21:31:13
how can i reduce my runtime
2017-03-06 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
2017-02-23 14:02:07
How to store such a large number with 1000000 digits?
2017-02-21 08:56:58
#saurabh your last two outputs are wrong. it must be 101 and 1001.
2017-02-14 19:55:47
why i am getting TLE error
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.