#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=100+5,M=N*4+5,K=31650,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,x,y,Df[N],Dh,In[N];vector<int> S[N];
bitset<N> f1[N],f2[N];
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) S[i].clear(),In[i]=0,f1[i].reset(),f2[i].reset();Dh=0;
	while(m--) scanf("%d%d",&x,&y),S[x].emplace_back(y),In[y]++;
	queue<int> q;for(i=1;i<=n;i++) if(!In[i]) q.emplace(i);
	while(!q.empty()){
		int x=q.front();q.pop();f1[x][x]=1;Df[++Dh]=x;
		for(int i:S[x]) {
			f1[i]|=f1[x];
			if(!--In[i]) q.emplace(i);
		}
	}
	if(Dh^n){
		for(j=1;j<=n;j++) Pc('0');Pc('\n');return;
	}
	for(i=Dh;i;i--) {
		int x=Df[i];for(int j:S[x]) f2[x]|=f2[j];f2[x][x]=1;
	}
	for(i=1;i<=n;i++) Pc(f1[i].count()-1<=n/2&&f2[i].count()-1<=n/2?'1':'0');Pc('\n');
}
int main(){
	int t;scanf("%d",&t);while(t--) Solve();
}