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.
The first line contains integer t, the number of test cases. Followed by t lines containing integers K.
For each K, output the smallest palindrome larger than K.
value = value[::-1]
T = int(input())
for _ in range(T):
k = int(input())
flag = 1
increase = k+1
while flag == 1:
if str(increase) == compare(str(increase)):
increase += 1