Problem: This is an interactive problem!

Nastia has a hidden permutation p of length n consisting of integers from 1 to n. You, for some reason, want to figure out the permutation. To do that, you can give her an integer t (1 ≤ t ≤ 2), two different indices i and j (1 ≤ i, j ≤ n, i ≠ j), and an integer x (1 ≤ x ≤ n - 1). 

Depending on t, she will answer: 

  * t = 1: max{(min{(x, p_i)}, min{(x + 1, p_j)})}; 
  * t = 2: min{(max{(x, p_i)}, max{(x + 1, p_j)})}. 



You can ask Nastia at most ⌊ \frac {3 ⋅ n} { 2} ⌋ + 30 times. It is guaranteed that she will not change her permutation depending on your queries. Can you guess the permutation?

Input

The input consists of several test cases. In the beginning, you receive the integer T (1 ≤ T ≤ 10 000) — the number of test cases.

At the beginning of each test case, you receive an integer n (3 ≤ n ≤ 10^4) — the length of the permutation p.

It's guaranteed that the permutation is fixed beforehand and that the sum of n in one test doesn't exceed 2 ⋅ 10^4.

Interaction

To ask a question, print "? t i j x" (t = 1 or t = 2, 1 ≤ i, j ≤ n, i ≠ j, 1 ≤ x ≤ n - 1) Then, you should read the answer.

If we answer with −1 instead of a valid answer, that means you exceeded the number of queries or made an invalid query. Exit immediately after receiving −1 and you will see the Wrong Answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream.

To print the answer, print "! p_1 p_2 … p_{n} (without quotes). Note that answering doesn't count as one of the ⌊ \frac {3 ⋅ n} {2} ⌋ + 30 queries.

After printing a query or printing the answer, do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++; 
  * System.out.flush() in Java; 
  * flush(output) in Pascal; 
  * stdout.flush() in Python; 
  * See the documentation for other languages. 



Hacks

To hack the solution, use the following test format.

The first line should contain a single integer T (1 ≤ T ≤ 10 000) — the number of test cases.

For each test case in the first line print a single integer n (3 ≤ n ≤ 10^4) — the length of the hidden permutation p.

In the second line print n space-separated integers p_1, p_2, …, p_n (1 ≤ p_i ≤ n), where p is permutation.

Note that the sum of n over all test cases should not exceed 2 ⋅ 10^4.

Example

Input


2
4

3

2

5

3

Output


? 2 4 1 3

? 1 2 4 2

! 3 1 4 2

? 2 3 4 2

! 2 5 3 4 1

Note

Consider the first test case.

The hidden permutation is [3, 1, 4, 2].

We print: "? 2 4 1 3" and get back min{(max{(3, p_4}), max{(4, p_1)})} = 3.

We print: "? 1 2 4 2" and get back max{(min{(2, p_2)}, min{(3, p_4)})} = 2.

Consider the second test case.

The hidden permutation is [2, 5, 3, 4, 1].

We print: "? 2 3 4 2" and get back min{(max{(2, p_3}), max{(3, p_4)})} = 3.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.StringTokenizer;

public class C {
    String filename = null;
    InputReader sc;

    int query(int t, int i, int j, int x) {
        System.out.println("? " + t + " " + (i + 1) + " " + (j + 1) + " " + x);
        System.out.flush();
        return sc.nextInt();
    }

    int findMax(int i, int j, int n) {
        int ans = query(1, i, j, n - 1);
        if (ans == n - 1) {
            return query(1, j, i, n - 1);
        }
        return ans;
    }

    int findMin(int i, int j) {
        int ans = query(2, i, j, 1);
        if (ans == 2) {
            return query(2, j, i, 1);
        }
        return ans;
    }

    void findPair(int i, int j, int n, int[] a) {
        int min = findMin(i, j);
        int max = findMax(i, j, n);
        int ans = query(1, i, j, min);
        if (ans == min) {
            a[i] = max;
            a[j] = min;
        } else {
            a[i] = min;
            a[j] = max;
        }
    }

    void solve() {
        int n = sc.nextInt();

        int[] a = new int[n];
        for (int i = 0; i + 1 < n; i += 2) {
            findPair(i, i + 1, n, a);
        }

        if (n % 2 == 1) {
            findPair(0, n - 1, n, a);
        }

        System.out.print("! ");
        for (int i = 0; i < n; i++) {
            System.out.print(a[i] + " ");
        }
        System.out.println();

        System.out.flush();
    }

    public void run() throws FileNotFoundException {
        if (filename == null) {
            sc = new InputReader(System.in);
        }
        else {
            sc = new InputReader(new FileInputStream(new File(filename)));
        }

        int nTests = sc.nextInt();
        for (int test = 0; test < nTests; test++) {
            solve();
        }
    }

    public static void main(String[] args) {
        C sol = new C();
        try {
            sol.run();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }

    class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

        public float nextFloat() {
            return Float.parseFloat(next());
        }

        public double nextDouble() {
            return Float.parseFloat(next());
        }

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

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