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:
import java.io.*;
import java.util.StringTokenizer;

import static java.lang.Double.parseDouble;
import static java.lang.Integer.compare;
import static java.lang.Integer.parseInt;
import static java.lang.Long.MAX_VALUE;
import static java.lang.Long.parseLong;
import static java.lang.Math.min;
import static java.lang.System.in;

public class Main {
    private static final int MOD = (int) (1E9 + 7);
    static FastScanner scanner = new FastScanner(in);

    public static void main(String[] args) throws IOException {
        // Write your solution here
        int t = 1;
        t = parseInt(scanner.nextLine());
        while (t-- > 0) {
            solve();
        }
    }

    private static void solve() throws IOException {
        int n = scanner.nextInt();
        if (n == 1) {
            System.out.println("9");
            return;
        }
        if (n == 2) {
            System.out.println("98");
            return;
        }
        StringBuilder ans = new StringBuilder("98");
        int d = 1;
        for (int i = 0; i < n - 2; i++) {
            int x = (d + 8) % 10;
            ans.append(x);
            d++;
        }
        System.out.println(ans);
    }

    private static int add(int a, int b) {
        long res = ((long) (a + MOD) % MOD + (b + MOD)) % MOD;
        return (int) res;
    }

    private static int mul(int a, int b) {
        long res = ((long) a % MOD * b % MOD) % MOD;
        return (int) res;
    }

    private static int binPow(int a, int b) {
        a %= MOD;
        int res = 1;
        while (b > 0) {
            if ((b & 1) != 0)
                res = mul(res, a);
            a = mul(a, a);
            b >>= 1;
        }
        return res;
    }

    private static int gcd(int a, int b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    private static int[] sieveOfEratosthenes(int n) {
        // Create a boolean array "prime[0..n]" and initialize all entries it as true. A value in prime[i] will
        // finally be false if i is Not a prime, else true.
        boolean[] prime = new boolean[n + 1];
        for (int i = 0; i <= n; i++)
            prime[i] = true;
        int cnt = 0;
        for (int p = 2; p * p <= n; p++) {
            // If prime[p] is not changed, then it is a prime
            if (prime[p]) {
                // Update all multiples of p
                for (int i = p * p; i <= n; i += p)
                    prime[i] = false;
            }
        }
        // Print all prime numbers
        for (int i = 2; i <= n; i++) {
            if (prime[i]) {
                cnt++;
            }
        }
        int[] arr = new int[cnt];
        int j = 0;
        for (int i = 2; i <= n; i++) {
            if (prime[i]) {
                arr[j++] = i;
            }
        }
        return arr;
    }

    private static class Pair implements Comparable<Pair> {
        int index, value;

        public Pair(int index, int value) {
            this.index = index;
            this.value = value;
        }

        public int compareTo(Pair o) {
            if (value != o.value) return compare(value, o.value);
            return compare(index, o.index);
        }
    }

    static public class SegmentTree {
        int pow;
        long[] min;

        public SegmentTree(long[] a) {
            pow = 1;
            while (pow < a.length) {
                pow *= 2;
            }
            min = new long[2 * pow];
            for (int i = 0; i < a.length; i++) {
                min[pow + i] = a[i];
            }
            for (int i = a.length; i < pow; i++) {
                min[pow + i] = MAX_VALUE / 2;
            }
            for (int i = pow - 1; i > 0; i--) {
                min[i] = f(min[2 * i + 1], min[2 * i + 1]);
            }
        }

        public long get(int l, int r) {
            return get(1, 0, pow, l, r);
        }

        private long get(int v, int tl, int tr, int l, int r) {
            if (l >= tr || r <= tl) {
                return MAX_VALUE / 2;
            }
            if (l <= tl && r >= tr) {
                return min[v];
            }
            int tm = (tl + tr) / 2;
            return f(get(2 * v, tl, tm, l, r), get(2 * v + 1, tm, tr, l, r));
        }

        public void set(int x, long value) {
            set(1, 0, pow, x, value);
        }

        private void set(int v, int tl, int tr, int x, long value) {
            if (x >= tr || x < tl) {
                return;
            }
            if (v >= pow) {
                min[v] = value;
                return;
            }
            int tm = (tl + tr) / 2;
            set(2 * v, tl, tm, x, value);
            set(2 * v + 1, tm, tr, x, value);
            min[v] = f(min[2 * v], min[2 * v + 1]);
        }

        public long f(long a, long b) {
            return min(a, b);
        }
    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        FastScanner(InputStream f) {
            br = new BufferedReader(new InputStreamReader(f));
        }

        String nextLine() {
            try {
                return br.readLine();
            } catch (IOException e) {
                return 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 parseInt(next());
        }

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

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

    }
}