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
2014-01-15 15:17:31 lukan thorare
http://ideone.com/******
plz help!

--ans--> Please use the forum, it is made for those questions.

Last edit: 2013-03-16 14:03:08
2014-01-15 15:17:31 Bumbler
Awesome problem !!
2014-01-15 15:17:31 Junior Prog
How to handle large numbers like 100000 digit numbers used here??

reply: string

Last edit: 2013-01-10 19:04:01
2014-01-15 15:17:31 Junior Prog
Hey can anyone tell me how to work with 100000 digits? I have never come across such a huge number before!
2014-01-15 15:17:31 abdelkarim
@problem setter :
please hide "Vijay Dhameliya" comment .

reply: comment deleted

Last edit: 2013-01-10 19:05:58
2014-01-15 15:17:31 DEVANSH PARASHAR
omg i forgot to notice its 1000000 digits not 1000000 fish
2014-01-15 15:17:31 Bharath Chandrasekar
ok..got it after 7 WA...never underestimate a problem!

Last edit: 2012-12-09 05:45:18
2014-01-15 15:17:31 Trần Mạnh Quân
It's really hard to have AC in ACM :(
2014-01-15 15:17:31 Jegan
it's great...

Last edit: 2012-08-03 16:28:32
2014-01-15 15:17:31 garretthh07
oh!!I think my methods is ok,but it gets wrong!!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.