#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=12,Maxs=5e6+10,mod=998244353;
int n,m;
int a[Maxn],b[Maxn],c[Maxn],d[Maxn],p[Maxn],fac[Maxn];
int f[Maxs];
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline void init(){
    n=read();m=read();
    fr(i,1,m) a[i]=read(),b[i]=read(),c[i]=read(),d[i]=read();
    fac[0]=1;fr(i,1,n) fac[i]=fac[i-1]*i;
}
int to[Maxn];
inline void work(){
    f[1]=1;fr(i,1,n) p[i]=i;
	int id=0;
	do{
		++id;
		int fl=1;
		fr(i,1,m) if(p[a[i]]<p[b[i]] && p[c[i]]>p[d[i]]) fl=0;
		if(fl==0) {f[id]=0;continue;}
		fr(i,1,n) to[p[i]]=i;
		fr(i,1,n-1) if(to[i]<to[i+1]) add(f[id+fac[n-to[i]]],f[id]);
	}while(next_permutation(p+1,p+n+1));
	writeln(f[id]);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
	init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}