#include <bits/stdc++.h>
using namespace std;
const int N=200005,mod=998244353;
int read(){int x=0,f=1;char ch=getchar();while (!isdigit(ch)&&ch!='-')ch=getchar();if (ch=='-')f=-1,ch=getchar();while (isdigit(ch))x=(x<<1)+(x<<3)+ch-48,ch=getchar();return x*f;
}
int n,m;
int vis[N],L[N],R[N],ans[N];
int Ha[N*4],hs;
vector <int> t[N*4*4];
void build(int rt,int L,int R){t[rt].clear();if (L==R)return;int mid=(L+R)>>1,ls=rt<<1,rs=ls|1;build(ls,L,mid);build(rs,mid+1,R);
}
void cover(int rt,int L,int R,int xL,int xR,int id){if (xL>R||xR<L)return;if (xL<=L&&R<=xR){t[rt].push_back(id);return;}int mid=(L+R)>>1,ls=rt<<1,rs=ls|1;cover(ls,L,mid,xL,xR,id);cover(rs,mid+1,R,xL,xR,id);
}
vector <int> res;
void Delete(int rt,int L,int R,int x){while (!t[rt].empty()){int id=t[rt].back();t[rt].pop_back();if (!vis[id])vis[id]=1,res.push_back(id);}if (L==R)return;int mid=(L+R)>>1,ls=rt<<1,rs=ls|1;if (x<=mid)Delete(ls,L,mid,x);elseDelete(rs,mid+1,R,x);
}
void solve(int Case){n=read(),m=read();hs=0;for (int i=1;i<=n;i++){L[i]=read(),R[i]=read();Ha[++hs]=L[i],Ha[++hs]=L[i]-1;Ha[++hs]=R[i],Ha[++hs]=R[i]-1;}Ha[++hs]=1e9+1;sort(Ha+1,Ha+hs+1);hs=unique(Ha+1,Ha+hs+1)-Ha-1;build(1,1,hs);for (int i=1;i<=n;i++){vis[i]=ans[i]=0;L[i]=lower_bound(Ha+1,Ha+hs+1,L[i])-Ha;R[i]=lower_bound(Ha+1,Ha+hs+1,R[i])-Ha;cover(1,1,hs,L[i],R[i],i);}printf("Case #%d:\n",Case);int last_ans=0;for (int k=1;k<=m;k++){int x=read()^last_ans;int p=lower_bound(Ha+1,Ha+hs+1,x)-Ha;res.clear();Delete(1,1,hs,p);if (res.size()>0){last_ans=1;for (int i=0;i<res.size();i++){int id=res[i];ans[id]=k;last_ans=1LL*last_ans*id%mod;}}elselast_ans=0;printf("%d\n",(int)res.size());}for (int i=1;i<n;i++)printf("%d ",ans[i]);printf("%d\n",ans[n]);
}
int main(){for (int T=read(),Case=1;T;T--,Case++)solve(Case);return 0;
}