// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 15, M = 4e6 + 10, MOD = 998244353;
inline int& add(int &x, ll y) {return x = (x + y) % MOD;}
int n, m, a[N], b[N], c[N], d[N], p[N], cur, f[M], pos[N], fac[N];
signed main() {
	read(n), read(m);
	F(i, 1, m) read(a[i]), read(b[i]), read(c[i]), read(d[i]);
	fac[0] = 1;
	F(i, 1, n) p[i] = i, fac[i] = i * fac[i - 1];
	f[1] = 1;
	do {
		cur++;
		bool flag = true;
		// debug << f[cur] << endl;
		F(i, 1, m)
			if (p[a[i]] < p[b[i]] && p[c[i]] > p[d[i]]) {
				flag = false;
				break;
			}
		if (flag) {
			F(i, 1, n) pos[p[i]] = i;
			F(i, 1, n - 1)
				if (pos[i] < pos[i + 1]) add(f[cur + fac[n - pos[i]]], f[cur]);
		}
	} while (next_permutation(p + 1, p + n + 1));
	cout << f[cur] << '\n';
	return 0;
}
/* why?
*/