#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=210;
int fa[2*maxn],n,m,a,b,c,d,vis[maxn];
long long ans=1;
int find(int x){
return fa[x]==x?fa[x]:fa[x]=find(fa[x]);
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=2*n;i++) fa[i]=i;
for(int i=1;i<=m;i++){
scanf("%d%d%d%d",&a,&b,&c,&d);
int fx=find(a),fy=find(c),nx=find(a+n),ny=find(c+n);
if(b==d){
if(find(a)==find(c+n)){
cout<<"No Answer"<<endl;
return 0;
}
else{
fa[fx]=fy; fa[nx]=ny;
}
}
else{
if(fx==fy){
cout<<"No Answer"<<endl;
return 0;
}
else{
fa[fx]=ny; fa[fy]=nx;
}
}
}
/*for(int i=2;i<=n;i++){
if(find(i)==find(1)){
cout<<i<<' ';
}
cout<<endl;
}*/
for(int i=1;i<=n;i++){
if(vis[i]) continue;
vis[i]=true;
//cout<<"1 "<<i<<' ';
for(int j=1;j<=n;j++){
if(i!=j&&!vis[j]&&find(i)==find(j+n)) vis[j]=true;
}
for(int j=1;j<=n;j++){
if(vis[j]) continue;
if(i==j) continue;
if(find(i)==find(j)){
//cout<<j<<' ';
for(int k=1;k<=n;k++){
if(k==i||k==j) continue;
if(find(j)==find(k+n)) vis[k]=true;
}
vis[j]=true;
}
}
//out<<endl;
ans*=2;
}
for(int i=1;i<=n;i++){
if(vis[i]) continue;
vis[i]=true;
//cout<<"2: "<<i<<' ';
for(int j=1;j<=n;j++){
if(vis[j]||i==j) continue;
if(find(i)==find(j+n)){
cout<<j<<' ';
vis[j]=true;
}
}
cout<<endl;
ans*=2;
}
for(int i=1;i<=n;i++){
if(!vis[i]){
// cout<<"3"<<' '<<i<<endl;
ans*=2;
}
}
cout<<ans<<endl;
return 0;
}
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=210;
int fa[2*maxn],n,m,a,b,c,d,vis[maxn];
long long ans=1;
int find(int x){
return fa[x]==x?fa[x]:fa[x]=find(fa[x]);
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=2*n;i++) fa[i]=i;
for(int i=1;i<=m;i++){
scanf("%d%d%d%d",&a,&b,&c,&d);
int fx=find(a),fy=find(c),nx=find(a+n),ny=find(c+n);
if(b==d){
if(find(a)==find(c+n)){
cout<<"No Answer"<<endl;
return 0;
}
else{
fa[fx]=fy; fa[nx]=ny;
}
}
else{
if(fx==fy){
cout<<"No Answer"<<endl;
return 0;
}
else{
fa[fx]=ny; fa[fy]=nx;
}
}
}
/*for(int i=2;i<=n;i++){
if(find(i)==find(1)){
cout<<i<<' ';
}
cout<<endl;
}*/
for(int i=1;i<=n;i++){
if(vis[i]) continue;
vis[i]=true;
//cout<<"1 "<<i<<' ';
for(int j=1;j<=n;j++){
if(i!=j&&!vis[j]&&find(i)==find(j+n)) vis[j]=true;
}
for(int j=1;j<=n;j++){
if(vis[j]) continue;
if(i==j) continue;
if(find(i)==find(j)){
//cout<<j<<' ';
for(int k=1;k<=n;k++){
if(k==i||k==j) continue;
if(find(j)==find(k+n)) vis[k]=true;
}
vis[j]=true;
}
}
//out<<endl;
ans*=2;
}
for(int i=1;i<=n;i++){
if(vis[i]) continue;
vis[i]=true;
//cout<<"2: "<<i<<' ';
for(int j=1;j<=n;j++){
if(vis[j]||i==j) continue;
if(find(i)==find(j+n)){
cout<<j<<' ';
vis[j]=true;
}
}
cout<<endl;
ans*=2;
}
for(int i=1;i<=n;i++){
if(!vis[i]){
// cout<<"3"<<' '<<i<<endl;
ans*=2;
}
}
cout<<ans<<endl;
return 0;
}