#include<bits/stdc++.h>
using namespace std;
#define ll int
#define f(i,a,b) for(int i=a;i<=b;i++)
ll T;
ll n,m;
ll a[500010];
ll t[500010];
#define lb(x) (x&(-x))
void add(ll k){
    while(k<=n)t[k]++,k+=lb(k);
}ll ask(ll k){
    ll res=0;while(k)res+=t[k],k-=lb(k);
    return res;
}
ll pre[500010];
ll pos[500010];
vector<ll>e[500010];
vector<ll>in;
#define pb push_back
struct node{ll id,x,o;};
ll cnt;
ll res[4000010];
ll w[4000010];
vector<node>q[500010];
int main(){
    cin>>T;while(T--){
        cin>>n>>m;
        in.clear();
        f(i,1,n){
            cin>>a[i];
            pos[i]=0,t[i]=0;
        }
        f(i,1,n){
            pos[i]=pre[a[i]]+1;
            pre[a[i]]=i;e[a[i]].pb(i);
            if(e[a[i]].size()==1){
                in.pb(a[i]),in.pb(a[i]+1);
                e[a[i]].pb(0),e[a[i]].pb(n+1);
            }
        }cnt=0;sort(in.begin(),in.end());
        for(int qwq=0;qwq<in.size();qwq++){
            ll x=in[qwq];
            if(qwq&&x==in[qwq-1])continue;
            if(!e[x].size()){
                w[++cnt]=x,q[n].pb({cnt,1,1});
                // cout<<x<<" "<<1<<" "<<n<<endl;
                continue;
            }sort(e[x].begin(),e[x].end());
            for(int i=0;i<e[x].size()-1;i++){
                ll l=e[x][i]+1,r=e[x][i+1]-1;
                if(l<=r){
                    w[++cnt]=x;
                    q[r].pb({cnt,l,1});
                    q[l-1].pb({cnt,l,-1});
                    // cout<<x<<" "<<l<<" "<<r<<endl;
                }
            }
        }
        // f(i,1,n)cout<<pos[i]<<" ";cout<<endl;
        f(i,1,n){
            add(pos[i]);
            for(int j=0;j<q[i].size();j++){
                res[q[i][j].id]+=ask(q[i][j].x)*q[i][j].o;
            }
        }f(i,1,cnt)res[i]-=w[i];
        ll mx=-0x3f3f3f3f;f(i,1,cnt)mx=max(mx,res[i]);
        // f(i,1,cnt)cout<<res[i]<<" "<<w[i]<<endl;
        cout<<mx<<endl;
        f(i,1,n)pre[a[i]]=0,e[a[i]].clear();
        f(i,0,n+1)q[i].clear();
        f(i,1,cnt)res[i]=w[i]=0;
    }
    return 0;
}