#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
void insertion_sort(vector<int> &a){
	int n=a.size();
	for(int i=1;i<n;i++){
		int temp=a[i];
		int j = i-1;
		while(j>=0 && a[j]>temp){
			a[j+1]=a[j];
			j--;
		}
		a[j+1]=temp;
	}
}
int main() {
	// your code goes here
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin>>t;
	while(t--){
	int n;
	cin>>n;
	vector<int> a(n);
 
	for(int i=0;i<n;i++)
	cin>>a[i];
	insertion_sort(a);
    }
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwoKdm9pZCBpbnNlcnRpb25fc29ydCh2ZWN0b3I8aW50PiAmYSl7CglpbnQgbj1hLnNpemUoKTsKCWZvcihpbnQgaT0xO2k8bjtpKyspewoJCWludCB0ZW1wPWFbaV07CgkJaW50IGogPSBpLTE7CgkJd2hpbGUoaj49MCAmJiBhW2pdPnRlbXApewoJCQlhW2orMV09YVtqXTsKCQkJai0tOwoJCX0KCQlhW2orMV09dGVtcDsKCX0KfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CgljaW4udGllKDApOwoJaW50IHQ7CgljaW4+PnQ7Cgl3aGlsZSh0LS0pewoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PiBhKG4pOwoJCglmb3IoaW50IGk9MDtpPG47aSsrKQoJY2luPj5hW2ldOwoJaW5zZXJ0aW9uX3NvcnQoYSk7CiAgICB9CglyZXR1cm4gMDsKfQ==

NAo4CjE3NiAtMjcyIC0yNzIgLTQ1IDI2OSAtMzI3IC05NDUgMTc2IAoyCi0yNzQgMTYxCjcKMjc0IDIwNCAtMTYxIDQ4MSAtNjA2IC03NjcgLTM1MQoyCjE1NCAtMTA5

4
8
176 -272 -272 -45 269 -327 -945 176 
2
-274 161
7
274 204 -161 481 -606 -767 -351
2
154 -109