// @author godmar
// same algorithm, but using faster I/O
import java.util.*;
import java.io.*;

public class sixseven_godmar_fastio
{
    static int solve(String n) {
        // try all candidates and pick the smallest feasible
        int winner = Integer.parseInt("1234567890".substring(0, n.length() + 1));
        int _n = Integer.parseInt(n);
        for (int i = 0; i < 10 - n.length(); i++) {
            int ca1 = Integer.parseInt("123456789".substring(i, i + n.length()));
            if (_n <= ca1)
                winner = Math.min(winner, ca1);
        }
        return winner;
    }

    public static void main(String []av) throws IOException {
        var in = new BufferedReader(new InputStreamReader(System.in));
        var out = new PrintWriter(System.out, false);
        int T = Integer.parseInt(in.readLine());
        for (int i = 0; i < T; i++)
            out.println(solve(in.readLine()));
        out.close();
    }
}