#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dou;
typedef pair<int,int> pii;
#define fi first
#define se second
#define mapa make_pair
typedef long double ld;
typedef unsigned long long ull;
#define ep emplace_back
template <typename T>inline void read(T &x){
	x=0;char c=getchar();bool f=0;
	for(;c<'0'||c>'9';c=getchar()) f|=(c=='-');
	for(;c>='0'&&c<='9';c=getchar())
	x=(x<<1)+(x<<3)+(c^48);
	x=(f?-x:x);
}
const int N=1e6+10;
int Test, n, m;
int a[N];
int lst[N];
int tr[N<<2], tag[N<<2];
inline void down(int p){
	if(tag[p]!=0){
		tr[p<<1]+=tag[p]; tag[p<<1]+=tag[p];
		tr[p<<1|1]+=tag[p]; tag[p<<1|1]+=tag[p];
		tag[p]=0;
	}
}
inline void mdf(int p, int l, int r, int L, int R, int x){
	if(L<=l&&r<=R){
		tr[p]+=x; tag[p]+=x;
		return ;
	}
	int mid=(l+r)>>1;
	down(p);
	if(L<=mid) mdf(p<<1, l, mid, L, R, x);
	if(R>mid) mdf(p<<1|1, mid+1, r, L, R, x);
	tr[p]=max(tr[p<<1], tr[p<<1|1]);
}
inline int get(int p, int l, int r, int L, int R){
	if(L<=l&&r<=R) return tr[p];
	int mid=(l+r)>>1, ret=-1e9;
	down(p);
	if(L<=mid) ret=max(ret, get(p<<1, l, mid, L, R));
	if(R>mid) ret=max(ret, get(p<<1|1, mid+1, r, L, R));
	return ret;
}
inline void clr(int p, int l, int r){
	tr[p]=0; tag[p]=0;
	if(l==r) return ;
	int mid=(l+r)>>1;
	clr(p<<1, l, mid); clr(p<<1|1, mid+1, r);
}
set<int> vec[N];
int main(){
	// freopen("D:\\nya\\acm\\A\\test.in","r",stdin);
	// freopen("D:\\nya\\acm\\A\\test.out","w",stdout);
	read(Test);
	while(Test--){
		read(n); read(m);
		unordered_map<int, int> h;
		int idx=n+2;
		for(int i=1; i<=n; ++i) {
			read(a[i]);
			if(a[i]>=n+2){
				if(h.find(a[i])==h.end()) h[a[i]]=idx, idx++;
				a[i]=h[a[i]];
			}
		}
		for(int i=1; i<=idx; ++i) lst[i]=0, vec[i].clear();
		clr(1, 1, n);
		int ans=-1e9;
		for(int i=1; i<=n; ++i){
			mdf(1, 1, n, lst[a[i]]+1, i, 1);
			lst[a[i]]=i;
			int c=a[i]+1;
			if(vec[a[i]].size()){
				set<int>::iterator it=vec[a[i]].end();
				do{
					--it;
					while(lst[c]>=(*it)) ++c;
					mdf(1, 1, n, *it, *it, a[i]-c);
					vec[c].insert(*it);
				}while(it!=vec[a[i]].begin());
				vec[a[i]].clear();
			}
			if(a[i]==1) vec[2].insert(i), mdf(1, 1, n, i, i, -2);
			else vec[1].insert(i), mdf(1, 1, n, i, i, -1);
			ans=max(ans, get(1, 1, n, 1, i));
		}
		printf("%d\n", ans);
	}

	return 0;
}