#include <bits/stdc++.h>

template <class T>
inline void read(T &res)
{
	char ch; bool flag = false; res = 0;
	while (ch = getchar(), !isdigit(ch) && ch != '-');
	ch == '-' ? flag = true : res = ch ^ 48;
	while (ch = getchar(), isdigit(ch))
		res = res * 10 + ch - 48;
	flag ? res = -res : 0;
}

template <class T>
inline void put(T x)
{
	if (x > 9)
		put(x / 10);
	putchar(x % 10 + 48);
}

template <class T>
inline void _put(T x)
{
	if (x < 0)
		x = -x, putchar('-');
	put(x);
}

template <class T>
inline void CkMin(T &x, T y) {x > y ? x = y : 0;}
template <class T>
inline void CkMax(T &x, T y) {x < y ? x = y : 0;}
template <class T>
inline T Min(T x, T y) {return x < y ? x : y;}
template <class T>
inline T Max(T x, T y) {return x > y ? x : y;}
template <class T>
inline T Abs(T x) {return x < 0 ? -x : x;}
template <class T>
inline T Sqr(T x) {return x * x;}
// 若传入 int x 同时结果可能爆 int 应这样写 Sqr((ll)x)

using std::map;
using std::set;
using std::pair;
using std::bitset;
using std::string;
using std::vector;
using std::complex;
using std::multiset;
using std::priority_queue;

typedef long long ll;
typedef long double ld;
typedef complex<ld> com;
typedef pair<int, int> pir;
const ld pi = acos(-1.0);
const ld eps = 1e-8;
const int N = 25;
const int M = 2105;
const int Maxn = 1e9;
const int Minn = -1e9;
const int mod = 998244353;
int T_data, n, m, n1, n2, C, T;
int id[N][3], sta[N * 3], vis[N][3];
ll f[(1 << 21) + 5], ans;
vector<int> e[3 * N];

inline int find_id(char ch)
{
	if (ch == 'R')
		return 0;
	if (ch == 'G')
		return 1;
	return 2;
}

inline void read_upperchar(int &_id)
{
	char ch;
	while (ch = getchar(), !isupper(ch));
	_id = find_id(ch);
}

inline void dfs1(int k, int s)
{
	if (k > n1)
	{
		++f[s];
		return ;
	}	
	for (int i = 0; i < 3; ++i)
		if (!vis[k][i])
		{
			for (int y : e[id[k][i]])
			{
				int p = (y + 2) / 3, q = (y - 1) % 3;
				++vis[p][q];
			}
			dfs1(k + 1, s | sta[id[k][i]]);
			for (int y : e[id[k][i]])
			{
				int p = (y + 2) / 3, q = (y - 1) % 3;
				--vis[p][q];
			}
		}
}

inline void dfs2(int k, int s)
{
	if (k > n)
	{
		ans += f[C ^ s];
		return ;
	}
	for (int i = 0; i < 3; ++i)
		if (!vis[k][i])
		{
			for (int y : e[id[k][i]])
			{
				int p = (y + 2) / 3, q = (y - 1) % 3;
				++vis[p][q];
			}
			dfs2(k + 1, s | (1 << (3 * (k - n1 - 1) + i)));
			for (int y : e[id[k][i]])
			{
				int p = (y + 2) / 3, q = (y - 1) % 3;
				--vis[p][q];
			}
		}
}

int main()
{
	read(n); read(m);
	for (int i = 1; i <= n; ++i)
	{
		id[i][0] = ++T;
		id[i][1] = ++T;
		id[i][2] = ++T;
	}
	n2 = n / 3, n1 = n - n2;
	int x, y, p, q;
	for (int i = 1; i <= m; ++i)
	{
		read(x);
		read_upperchar(y);
		read(p);
		read_upperchar(q);
		
		if (x > p)
		{
			std::swap(x, p);
			std::swap(y, q);
		}
		
		if (x <= n1 && p <= n1)
		{
			e[id[x][y]].push_back(id[p][q]);
			e[id[p][q]].push_back(id[x][y]);
		}
		else if (x > n1 && p > n1)
		{
			e[id[x][y]].push_back(id[p][q]);
			e[id[p][q]].push_back(id[x][y]);
		}
		else 
			sta[id[x][y]] |= 1 << (3 * (p - n1 - 1) + q);
	}
	dfs1(1, 0);
	C = (1 << (3 * n2)) - 1;
	for (int i = 0; i < 3 * n2; ++i)
		for (int j = 1; j <= C; ++j)
			if (j >> i & 1)
				f[j] += f[j ^ (1 << i)];
	dfs2(n1 + 1, 0);
	std::cout << ans << std::endl;
	return 0;
}