#include <bits/stdc++.h>
using namespace std;

struct node {
    int a, x, y;
    node(int a_, int x_, int y_) : a(a_), x(x_), y(y_) {}
};

int N, M, K;
vector<node> adj[22];
vector<int> vec;
int dp[1<<21];

void init(int pos) {
    if (pos == N) {
        int mask = 0;
        for (int i = 0; i < K; i++) {
            mask |= (1<<(3*i+vec[i]));
        }
        dp[mask] = 1;
        return;
    }
    for (int i = 0; i < 3; i++) {
        bool ok = true;
        for (auto& e : adj[pos]) {
            if (e.a >= N-K && vec[e.a-N+K] == e.x && i == e.y) {
                ok = false;
                break;
            }
        }
        if (ok) {
            vec.push_back(i);
            init(pos+1);
            vec.pop_back();
        }
    }
}

long long go(int pos) {
    if (pos == N-K) {
        int mask = 0;
        for (int i = 0; i < K; i++) {
            for (auto& e : adj[N-K+i]) {
                if (e.a < N-K && vec[e.a] == e.x) {
                    mask |= (1<<(3*i+e.y));
                }
            }
        }
        mask ^= (1<<(3*K))-1;
        return dp[mask];
    }
    long long ret = 0;
    for (int i = 0; i < 3; i++) {
        bool ok = true;
        for (auto& e : adj[pos]) {
            if (vec[e.a] == e.x && i == e.y) {
                ok = false;
                break;
            }
        }
        if (ok) {
            vec.push_back(i);
            ret += go(pos+1);
            vec.pop_back();
        }
    }
    return ret;
}

int ctoi(char c) {
    int ret = 0;
    if (c == 'R') ret = 0;
    else if (c == 'G') ret = 1;
    else ret = 2;
    return ret;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> N >> M;
    K = N / 3;
    for (int i = 0; i < M; i++) {
        int a, b;
        char x, y;
        cin >> a >> x >> b >> y;
        adj[b-1].emplace_back(a-1, ctoi(x), ctoi(y));
    }
    init(N-K);
    for (int i = 0; i < 3*K; i++) {
        for (int mask = 0; mask < (1<<(3*K)); mask++) {
            if ((mask>>i)&1) {
                dp[mask] += dp[mask^(1<<i)];
            }
        }
    }
    cout << go(0) << '\n';
    return 0;
}