#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mp make_pair
#define vi vector<int>
#define eb emplace_back
#define pli pair<LL, int>
#define fi first
#define se second
#define rep(rp,a,b) for(int rp=a;rp<=b;++rp)
#define per(bl,a,b) for(int bl=a;bl>=b;--bl)
#define segc int mid = L+R>>1, lc = now<<1, rc = lc|1
const int N = 1e7+5, MOD = 998244353, INF = 1e9;
inline int read() {
	register int x = 0, f = 1;
	register char ch = 0;
	while(ch < 48 || ch > 57) {
			ch = getchar();
			if (ch == '-') f = -1;
		}
	while(ch >= 48 && ch <= 57) x = x*10+(ch^48), ch = getchar();
	return f*x;
}

int n, m, fac[15], a[15], b[15], c[15], d[15], dp[N], val[15];
vi p;
void init() {
	fac[0] = 1; p.eb(0);
	rep (i, 1, n) fac[i] = fac[i-1]*i, p.eb(i);
}

int main() {
	n = read(), m = read();
	rep (i, 1, m) {
		a[i] = read();
		b[i] = read();
		c[i] = read();
		d[i] = read();
	}
	init();
	dp[1] = 1;
	int p1 = 0;
	do {
		++p1;
		int flag = 1;
		rep (i, 1, m)
			if(p[a[i]] < p[b[i]] && p[c[i]] > p[d[i]]) {flag=0; break;}
		if (!flag) dp[p1] = 0;
		rep (i, 1, n) val[p[i]]=i;
		rep (i, 1, n-1)
			if (val[i] < val[i+1]) (dp[p1+fac[n-val[i]]] += dp[p1]) %= MOD;
	} while (next_permutation(p.begin()+1, p.end()));
	printf("%d\n", dp[fac[n]]);
	return 0;
}