//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tp;
	cin>>tp;
	int t;
	cin>>t;
	while(t--)
	{
		int n,k;
		cin>>n>>k;
		vector<int> vec;
		map<int,int> Mp;
		for(int i=1;i<=k;i++)
		{
			int x;
			cin>>x;
			if(tp==2) x=n+1-x;
			vec.pb(x);
		}
		srt(vec);
		for(auto x:vec)
			Mp[x]=1;
		int p=vec[0];
		vector<int> ans;
		for(auto x:vec)
		{
			p=max(p,x);
			while(Mp[(p-1)%n+1])
				p++;
			Mp[(p-1)%n+1]=1;
			ans.pb((p-1)%n+1);
		}
		srt(ans);
		for(auto x:ans)
			cout<<(tp==1?x:n+1-x)<<" ";
		cout<<'\n';
	}
	return 0;
}