#include <bits/stdc++.h>
using namespace std;
const int N = 25,B = 7,M = 1e4 + 5;
typedef long long ll;
typedef array<int,N - B> aint;
int n,m;
int P[M],Q[M],X[M],Y[M];
const int Sz = 1 << (3 * B);
ll sum[Sz];
inline bool Check(int lim,aint S) {
	for(int i = 1;i <= m;i++) 
		if(P[i] <= lim && Q[i] <= lim && S[P[i]] == X[i] && S[Q[i]] == Y[i]) return false;
	return true;
}
inline aint Next(int n,aint S) { // 方便枚举
	int i = 1;
	while(i <= n && S[i] == 2) S[i++] = 0;
	assert(i <= n);++S[i];
	return S;
}	
inline bool isfull(int n,aint S) {
	for(int i = 1;i <= n;i++)
		if(S[i] != 2) return false;
	return true;
}
int Lims[N][3];
int main() {
	cin >> n >> m;
	for(int i = 1;i <= m;i++) {
		char c1,c2;
		cin >> P[i] >> c1 >> Q[i] >> c2;
		X[i] = (c1 == 'R') ? 0 : (c1 == 'G' ? 1 : 2);
		Y[i] = (c2 == 'R') ? 0 : (c2 == 'G' ? 1 : 2); 
	}
	if(n <= B) {
		aint S;S.fill(0);
		int ans = 0;
		while(1) {
			ans += Check(n,S);
			if(isfull(n,S)) break;
			S = Next(n,S);
		}
		cout << ans << endl;
		return 0;
	}
	aint S;S.fill(0);
	while(1) {
		int flg = 1;
		for(int i = 1;i <= m;i++)
			if(P[i] > n - B && Q[i] > n - B && S[P[i] - (n - B)] == X[i] && S[Q[i] - (n - B)] == Y[i])
				{ flg = 0;break;}
		if(flg) {
			int now = 0;
			for(int i = 1;i <= B;i++) {
				if(S[i] == 0) now |= (1 << 3 * i - 3);
				if(S[i] == 1) now |= (1 << 3 * i - 2);
				if(S[i] == 2) now |= (1 << 3 * i - 1);
			}
			sum[now]++;
		}
		if(isfull(B,S)) break;
		S = Next(B,S);
	}
	int bitsiz = 3 * B;
	for(int j = 0;j < bitsiz;j++)
		for(int i = 0;i < (1 << bitsiz);i++)
			if((i >> j) & 1) sum[i] += sum[i ^ (1 << j)];
	for(int i = 1;i <= n - B;i++)
		for(int c = 0;c < 3;c++) {
			for(int t = 1;t <= m;t++)
				if(P[t] == i && Q[t] > n - B && X[t] == c) {
					if(Y[t] == 0) Lims[i][c] |= (1 << 3 * (Q[t] - (n - B)) - 3);
					if(Y[t] == 1) Lims[i][c] |= (1 << 3 * (Q[t] - (n - B)) - 2);
					if(Y[t] == 2) Lims[i][c] |= (1 << 3 * (Q[t] - (n - B)) - 1);
				}
		}
	S.fill(0);
	ll ans = 0;
	while(1) {
		if(Check(n - B,S)) {
			int nowl = 0;
			for(int i = 1;i <= n - B;i++)
				nowl |= Lims[i][S[i]];
			ans += sum[(1 << bitsiz) - 1 - nowl];
		}
		if(isfull(n - B,S)) break;
		S = Next(n - B,S);
	}
	cout << ans << endl;
	return 0;
}