#include <vector>
#include <string>

// Afla raspunsul la interactiune daca ar trimite sirurile de caractere A si B de marime N
// A si B trebuie indexate de la 0 si sa fie de marime cel putin N
int query(std::string A, std::string B);

using namespace std;
 
int query(string A, string B);
void answer(vector<int> perm);

// De aici in sus nu ar trebui sa modifici nimic

// Functia trebuie sa returneze permutarea ceruta
// Permutarea aici in implementare va fi indexata de la 0

std::vector<int> find_permutation(int N) {

    std::vector<int> perm;
    for(int i = 1; i <= N; ++i)
        perm.push_back(i);
 
    return perm;

	vector<int> perm;
	for(int i = 1; i <= N; ++i)
		perm.push_back(i);
 
	return perm;

}
// De aici in jos nu ar trebui sa modifici nimic

int query(std::string A, std::string B) {
    int val;
    std::cout << "? " << A << " " << B << std::endl;
 
    std::cin >> val;
    if(val == -1)
        exit(0);
    return val;

int query(string A, string B) {
	int val;
	cout << "? " << A << " " << B << endl;
 
	cin >> val;
	if(val == -1)
		exit(0);
	return val;
}
 
void answer(vector<int> perm) {
	cout << "! ";
	for(auto it: perm)
		cout << it << " ";
	cout << endl;

}
int main() {

    int T;

	int T;

    std::cin >> T;
 
    while(T--) {
        int N;
        std::cin >> N;
        std::vector<int> perm = find_permutation(N);
 
        std::cout << "! ";
        for(auto it: perm)
            std::cout << it << " ";
        std::cout << std::endl;
    }

	cin >> T;
 
	while(T--) {
		int N;
		cin >> N;
		vector<int> perm = find_permutation(N);
		answer(perm);
	}

    return 0;

	return 0;

}

==
h1. Template C