#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define tp(x) printf("x = %d\n",x)
#define ansp(x) printf("%d\n",x)
//inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=x&(-x);return res;}
//inline void add(int x,int d){while(x<=n)c[x]+=d,x+=x&(-x);}
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll inf = 0x3f3f3f3f;
const int mx = 1<<11;
const int mod = 1e9+7;
int n,m,x,dp[mx],ans[mx],cnt[mx];
int main(){
//freopen("F:\\in.txt","r",stdin);
int T=10; scanf("%d",&T);
while(T--){
s2(n,m);
x = 1<<n;
for(int i=0;i<x;i++) dp[i]=0,cnt[i]=__builtin_popcount(i);
dp[0] = 1;
while(m--){
char cmd[5];
int a,b;
scanf("%s %d %d",cmd,&a,&b);
a=1<<(a-1);
b=1<<(b-1);
if(cmd[0] == '+')
for(int i = x-1; i>0; i--){
if((i&a)&&(i&b)){
dp[i] += dp[i^a^b];
if(dp[i] >= mod)
dp[i] -= mod;
}
}
else
for(int i = 0; i<x; i++){
if((i&a)&&(i&b)){
dp[i] -= dp[i^a^b];
if(dp[i] < 0)
dp[i] += mod;
}
}
for(int i = 1; i <= n; i++)
ans[i] =0;
for(int i = 1; i < x; i++){
ans[cnt[i]] += dp[i];
if(ans[cnt[i]] >= mod)
ans[cnt[i]] -= mod;
}
for(int i = 2; i <= n ;i+=2)
if(i == 2)
printf("%d",ans[i]);
else
printf(" %d",ans[i]);
puts("");
}
}
return 0;
}
