Problem: Andre has very specific tastes. Recently he started falling in love with arrays.

Andre calls an nonempty array b good, if sum of its elements is divisible by the length of this array. For example, array [2, 3, 1] is good, as sum of its elements — 6 — is divisible by 3, but array [1, 1, 2, 3] isn't good, as 7 isn't divisible by 4. 

Andre calls an array a of length n perfect if the following conditions hold: 

  * Every nonempty subarray of this array is good. 
  * For every i (1 ≤ i ≤ n), 1 ≤ a_i ≤ 100. 



Given a positive integer n, output any perfect array of length n. We can show that for the given constraints such an array always exists.

An array c is a subarray of an array d if c can be obtained from d by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100). Description of the test cases follows.

The first and only line of every test case contains a single integer n (1 ≤ n ≤ 100).

Output

For every test, output any perfect array of length n on a separate line. 

Example

Input


3
1
2
4


Output


24
19 33
7 37 79 49

Note

Array [19, 33] is perfect as all 3 its subarrays: [19], [33], [19, 33], have sums divisible by their lengths, and therefore are good.

Solution (in JAVA):

Solution:
import java.io.PrintWriter;
import java.util.*;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;

public class Main {

    void solve(InputReader in, PrintWriter out) {
        int t = in.nextInt();
        for (int i = 0; i < t; ++i) {
            int n = in.nextInt();
            for (int j = 0; j < n; ++j) {
                out.print(1 + " ");
            }
            out.println();
        }
    }

    public static void main(String[] args) {
        try (PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out, 1 << 16))) {
            InputReader in = new InputReader(System.in);
            Main template = new Main();
            template.solve(in, out);
        }
    }

    static class InputReader {

        private InputStream stream;
        private static final int DEFAULT_BUFFER_SIZE = 1 << 16;
        private static final int EOF = -1;
        private byte[] buf = new byte[DEFAULT_BUFFER_SIZE];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int[] readIntArray(int tokens) {
            int[] ret = new int[tokens];
            for (int i = 0; i < tokens; i++) {
                ret[i] = nextInt();
            }
            return ret;
        }

        public int read() {
            if (this.numChars == EOF) {
                throw new UnknownError();
            } else {
                if (this.curChar >= this.numChars) {
                    this.curChar = 0;

                    try {
                        this.numChars = this.stream.read(this.buf);
                    } catch (IOException ex) {
                        throw new InputMismatchException();
                    }

                    if (this.numChars <= 0) {
                        return EOF;
                    }
                }

                return this.buf[this.curChar++];
            }
        }

        public int nextInt() {
            int c;
            for (c = this.read(); isSpaceChar(c); c = this.read()) {
            }

            byte sgn = 1;
            if (c == 45) {
                sgn = -1;
                c = this.read();
            }

            int res = 0;

            while (c >= 48 && c <= 57) {
                res *= 10;
                res += c - 48;
                c = this.read();
                if (isSpaceChar(c)) {
                    return res * sgn;
                }
            }

            throw new InputMismatchException();
        }

        public long nextLong() {
            int c;
            for (c = this.read(); isSpaceChar(c); c = this.read()) {
            }

            byte sgn = 1;
            if (c == 45) {
                sgn = -1;
                c = this.read();
            }

            long res = 0;

            while (c >= 48 && c <= 57) {
                res *= 10L;
                res += c - 48;
                c = this.read();
                if (isSpaceChar(c)) {
                    return res * sgn;
                }
            }
            throw new InputMismatchException();
        }

        public double nextDouble() {
            double ret = 0, div = 1;
            int c = read();
            while (c <= ' ') {
                c = read();
            }
            boolean neg = (c == '-');
            if (neg) {
                c = read();
            }

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg) {
                return -ret;
            }
            return ret;
        }

        public String next() {
            int c;
            while (isSpaceChar(c = this.read())) {
            }

            StringBuilder result = new StringBuilder();
            result.appendCodePoint(c);

            while (!isSpaceChar(c = this.read())) {
                result.appendCodePoint(c);
            }

            return result.toString();
        }

        public String nextLine() {
            int c;
            StringBuilder result = new StringBuilder();
            boolean read = false;
            while ((c = this.read()) != '\n') {
                if (c == -1) {
                    return null;
                }
                result.appendCodePoint(c);
                read = true;
            }
            if (!read) {
                return null;
            }
            return result.toString();
        }

        public static boolean isSpaceChar(int c) {
            return c == 32 || c == 10 || c == 13 || c == 9 || c == EOF;
        }

        public int[] nextIntArray(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        public long[] nextLongArray(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }

        public int[][] nextIntMatrix(int n, int m) {
            int[][] arr = new int[n][m];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    arr[i][j] = nextInt();
                }
            }
            return arr;
        }

        public long[][] nextLongMatrix(int n, int m) {
            long[][] arr = new long[n][m];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    arr[i][j] = nextLong();
                }
            }
            return arr;
        }

        public char[] nextCharArray() {
            return next().toCharArray();
        }

        public double[] nextDoubleArray(int n) {
            double[] ret = new double[n];
            for (int i = 0; i < n; i++) {
                ret[i] = nextDouble();
            }
            return ret;
        }

        public int[]
        nextIntArrayOneBased(int n) {
            int[] ret = new int[n + 1];
            for (int i = 1; i <= n; i++) {
                ret[i] = nextInt();
            }
            return ret;
        }

        public char[][] nextCharMatrix(int n, int m) {
            char[][] res = new char[n][m];
            for (int i = 0; i < n; ++i) {
                res[i] = nextCharArray();
            }
            return res;
        }
    }

}