#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;


void solve()
{
	int n, m;
	cin >> n >> m;
	VI idx(n);
	ordered_set s;
	FOR(i, 0, n)
	{
		idx[i] = n - i;
		s.insert(idx[i]);
	}
	FOR(i, 0, m)
	{
		int x;
		cin >> x;
		x--;
		
		if(i)
			cout << " ";
		cout << n - 1 - s.order_of_key(idx[x]);
		
		s.erase(idx[x]);
		idx[x] = n + i + 1;
		s.insert(idx[x]);
	}
	cout << "\n";
}


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while(t--)
		solve();
	
	
	return 0;
}