#include<set>#include<map>#include<queue>#include<stack>#include<cmath>#include<vector>#include<string>#include<cstdio>#include<cstring>#include<stdlib.h>#include<iostream>#include<algorithm>using namespace std;#define eps 1E-8/*注意可能会有输出-0.000*/#define Sgn(x) (x<-eps? -1 :x<eps? 0:1)//x为两个浮点数差的比较,注意返回整型#define Cvs(x) (x > 0.0 ? x+eps : x-eps)//浮点数转化#define zero(x) (((x)>0?(x):-(x))<eps)//判断是否等于0#define mul(a,b) (a<<b)#define dir(a,b) (a>>b)typedef long long ll;typedef unsigned long long ull;const int Inf=1<<28;const double Pi=acos(-1.0);const int Mod=1e9+7;const int Max=200010;//开成两倍，因为要向后添加int mp[Max],bit[Max],tot,tol;//映射位置 被映射的树状数组 总大小int lowbit(int x){    return x&(-x);}void Add(int x,int y){    while(x<=tol)    {        bit[x]+=y;        x+=lowbit(x);    }    return ;}int Sum(int x){    int sum=0;    while(x)    {        sum+=bit[x];        x-=lowbit(x);    }    return sum;}void Init(int n,int m){    memset(bit,0,sizeof(bit));    tot=n;    tol=n+m;    for(int i=1; i<=n; ++i)//倒序存储    {        mp[i]=n-i+1;        Add(mp[i],1);    }    return;}int Solve(int n,int m){    ll ans=0;    int pos=mp[m];    //printf("\npos=%d\n",pos);    ans=n-Sum(pos);//求后面的    tot++;    Add(pos,-1);//更新    Add(tot,1);    mp[m]=tot;//映射到开头    return ans;}int main(){    int t,n,m,num;    scanf("%d",&t);    while(t--)    {        scanf("%d %d",&n,&m);        Init(n,m);        for(int i=0;i<m;++i)        {            scanf("%d",&num);            printf("%d%c",Solve(n,num),i==m-1?‘\n‘:‘ ‘);        }    }    return 0;}