Problem: There are n digital panels placed in a straight line. Each panel can show any digit from 0 to 9. Initially, all panels show 0.

Every second, the digit shown by each panel increases by 1. In other words, at the end of every second, a panel that showed 9 would now show 0, a panel that showed 0 would now show 1, a panel that showed 1 would now show 2, and so on.

When a panel is paused, the digit displayed on the panel does not change in the subsequent seconds.

You must pause exactly one of these panels, at any second you wish. Then, the panels adjacent to it get paused one second later, the panels adjacent to those get paused 2 seconds later, and so on. In other words, if you pause panel x, panel y (for all valid y) would be paused exactly |x−y| seconds later.

For example, suppose there are 4 panels, and the 3-rd panel is paused when the digit 9 is on it.

  * The panel 1 pauses 2 seconds later, so it has the digit 1; 
  * the panel 2 pauses 1 second later, so it has the digit 0; 
  * the panel 4 pauses 1 second later, so it has the digit 0. 



The resulting 4-digit number is 1090. Note that this example is not optimal for n = 4.

Once all panels have been paused, you write the digits displayed on them from left to right, to form an n digit number (it can consist of leading zeros). What is the largest possible number you can get? Initially, all panels show 0.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Each test case consists of a single line containing a single integer n (1 ≤ n ≤ 2⋅10^5).

It is guaranteed that the sum of n over all test cases does not exceed 2⋅10^5.

Output

For each test case, print the largest number you can achieve, if you pause one panel optimally.

Example

Input


2
1
2


Output


9
98

Note

In the first test case, it is optimal to pause the first panel when the number 9 is displayed on it.

In the second test case, it is optimal to pause the second panel when the number 8 is displayed on it.

Solution (in JAVA):

Solution:
/*******************************************************************************
 * author  : dante1
 * created : 08/01/2021 20:08
 *******************************************************************************/
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
// import java.math.BigInteger;
import java.util.*;

public class a {
    public static void main(String[] args) {
        int T = in.nextInt();
        while (T-- > 0) {
            int n = in.nextInt();
            if (n == 1) {
                out.print(9);
            } else if (n == 2) {
                out.print(98);
            } else {
                out.print(989);
                for (int i = 0; i < n-3; i++) {
                    out.print(i%10);
                }
            }
            out.println();
        }
        out.flush();
        out.close();
    }

    // Change Array type as necessary.
    static void printArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            out.print(arr[i] + " ");
        }
        out.println();
    }

    static int search(int[] arr, int target) {
        // ~ [lower_bound] & [upper_bound -> search for 1+target]
        int lo = 0, hi = arr.length - 1;
        while (lo <= hi) {
            int mid = (lo + hi) >> 1;
            if (arr[mid] >= target) {
                hi = mid - 1;
            } else {
                lo = mid + 1;
            }
        }
        // Ensure existence for exact matches
        // if (lo == arr.length || arr[lo] != target)
        // {
        //     return -1;
        // }
        return lo;
    }

    static void sort(int[] arr) {
        // Random Shuffle guarantees O(nlogn) WCTC for Quick Sort.
        Random rnd = new Random();
        for (int i = arr.length - 1; i > 0; i--) {
            swap(arr, i, rnd.nextInt(i));
        }
        // Dual-Pivot Quicksort Implementation
        Arrays.sort(arr);
    }

    static boolean[] sieve(int n) {
        boolean[] primes = new boolean[n + 1];
        for (int i = 2; i <= n; i++) {
            if (i == 2 || ((i & 1) == 1)) {
                primes[i] = true;
            }
        }
        for (int p = 3; p * p <= n; p += 2) {
            if (primes[p] && 1l * p * p <= n) {
                for (int k = p * p; k <= n; k += p) {
                    primes[k] = false;
                }
            }
        }
        return primes;
    }

    // MLE -> Use BitSet
    static BitSet bitsieve(int n) {
        BitSet primes = new BitSet(n + 1);
        for (int i = 2; i <= n; i++) {
            if (i == 2 || ((i & 1) == 1)) {
                primes.set(i);
            }
        }
        for (int p = 3; p * p <= n; p += 2) {
            if (primes.get(p) && 1l * p * p <= n) {
                for (int k = p * p; k <= n; k += p) {
                    primes.set(k, false);
                }
            }
        }
        return primes;
    }

    static void swap(int[] arr, int i, int j) {
        arr[i] = arr[i] ^ arr[j];
        arr[j] = arr[i] ^ arr[j];
        arr[i] = arr[i] ^ arr[j];
    }

    static void swap(int x, int y) {
        x = x ^ y;
        y = x ^ y;
        x = x ^ y;
    }

    // Precompute before running testcases
    static long[] fact;
    static void factorial(int lim) {
        fact = new long[lim];
        fact[0] = 1;
        for (int i = 1; i < lim; i++) {
            fact[i] = (fact[i - 1] * i) % MOD;
        }
    }

    static long modInv(long x) {
        return pow(x, MOD - 2, MOD);
    }

    static long modInv(long x, int MOD) {
        return pow(x, MOD - 2, MOD);
    }

    static long perm(int n, int r) {
        // assert(fact != null);
        if (n < r) {
            return 0;
        }
        return (fact[n] * (modInv(fact[n - r]) % MOD)) % MOD;
    }

    static long comb(int n, int r) {
        // assert(fact != null);
        if (n < r) {
            return 0;
        }
        if (n == r) {
            return 1;
        }
        return (fact[n] * (((fact[r] % MOD) * (fact[n - r] % MOD)) % MOD)) % MOD;
    }

    static long pow(long x, long y) {
        // assert(y >= 0);
        if (x == 0) {
            return 0;
        }
        if (x == 1 || y == 0) {
            return 1;
        }
        long res = 1l;
        while (y > 1) {
            if ((y & 1) == 1) {
                res *= x;
            }
            x *= x;
            y >>= 1;
        }
        return res * x;
    }

    static long pow(long x, long y, int MOD) {
        // assert(y >= 0);
        if (x == 0) {
            return 0;
        }
        if (x == 1 || y == 0) {
            return 1;
        }
        // Use Math.floorMod or (MOD + res)%MOD
        // for handling negative x if necessary.
        x %= MOD;
        long res = 1l;
        while (y > 1) {
            if ((y & 1) == 1) {
                res = (res * x) % MOD;
            }
            x = (x * x) % MOD;
            y >>= 1;
        }
        return (res * x) % MOD;
    }

    // Handle I/O
    static int MOD = (int) (1e9 + 7);
    static FastScanner in = new FastScanner();
    static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
            st = null;
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] readIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] readLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        double[] readDoubleArray(int size) {
            double[] arr = new double[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextDouble();
            }
            return arr;
        }
    }
}