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
johanfire: 2021-10-13 04:45:28

I got it but it's exceding time limit, I wrote 19 lines of code :(

kemar: 2021-09-17 18:06:08

It seems that the last line of the input file doesn't end with a '\n'.
This costed me more than 10 WA !
Finally got AC in Python using a list of digits.

adam____: 2021-08-26 16:31:47

Big thanks to @shreyas_07 for TCs, done in bout 1.5h, be careful with inverting the order of digits and with odd and even number of them.

novinsky1: 2021-08-19 09:00:15

yes, it passed :D

freaking_omen: 2021-08-19 08:18:34

Testcases given by Shreyas all are passed but not accepted

novinsky1: 2021-08-19 08:12:14

what is wrong in <snip> ?

[NG]: Read the footer.

Last edit: 2021-08-19 10:30:43
deepak_07: 2021-08-11 11:36:17

can anyone explain the concept

happydracula: 2021-06-23 15:31:46

FUCK YES

loser_404: 2021-06-02 16:17:08

One of the best problems ever faced.

botter_code: 2021-06-02 12:54:39

lessgoo


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

Problem's scores 1 vote

Concept difficulty
Concept difficulty 37%
Implementation difficulty
Implementation difficulty 50%
458 16