#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 25 , C = 3;
int n , m; ll ans , lim[N][C] , hi[N];
map<ull , ll>mp[N];
ll Dfs(ll x , ll st)
{
	if(x < 0)return 1;
	if(mp[x].find(st) != mp[x].end())
		return mp[x][st];
	ll ans = 0;
	for(int c = 0 ; c < 3 ; c++)
		if(x == n - 1 || ((~st >> (x * 3 + c)) & 1))
			ans += Dfs(x - 1 , (st & hi[x]) | lim[x][c]);
	return mp[x][st] = ans;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0) , cout.tie(0);
	cin >> n >> m;
	for(int i = 1 ; i <= m ; i++)
	{
		int a , x , b , y;
		cin >> a >> x >> b >> y;
		// cerr << i << ":" << a - 1 << ' ' << x << ' ' << b - 1 << ' ' << y << "\n";
		lim[--b][y] |= (1ull << ((--a) * 3 + x));
	}
	hi[0] = 0;
	for(int i = 1 ; i < n ; i++)
		hi[i] = hi[i - 1] << 3 | 7;
	cout << Dfs(n - 1 , 0) << "\n";
	return 0;
}