uva11175

#include<cstdio>
#include<cstring>
using namespace std;
int m,k,g1[310][310],g2[310][310],n1[310],n2[310],to[310];
int solve(){
	for(int i=0;i<m;i++){
		memset(to,0,sizeof(to));
		for(int j=0;j<n2[i];j++){
			for(int k=0;k<n1[g2[i][j]];k++)
			to[g1[g2[i][j]][k]]++;
		}
		for(int j=0;j<m;j++){
			if(to[j] && to[j]!=n2[i])
			return 0;
		}
	}
	return 1;
}
int main(){
	int T,t=1,a,b;
	scanf("%d",&T);
	while(T--){
		memset(n1,0,sizeof(n1));
		memset(n2,0,sizeof(n2));
		scanf("%d%d",&m,&k);
		for(int i=0;i<k;i++){
			scanf("%d%d",&a,&b);
			g1[a][n1[a]++]=b;
			g2[b][n2[b]++]=a;
		}
		printf("Case #%d: ",t++);
		if(solve()) printf("Yes\n");
		else printf("No\n");
	}
}