// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
// mt19937 mrand(random_device{}());
// int rnd(int x) { return mrand() % x; }
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
int lg2(int64 x) { return sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n, m;
  cin >> n >> m;
  const string s = "RGB";
  auto g = vect<int>(0, n * 3, n * 3);
  for (int i = 0; i < m; ++i) {
    int x, y;
    string sx, sy;
    cin >> x >> sx >> y >> sy;
    --x; --y;
    int kx = s.find(sx[0]), ky = s.find(sy[0]);
    g[x * 3 + kx][y * 3 + ky] = 1;
  }
  int L = min(n, 14), R = n - L, len = 3 * R;

  vector<int> p3(n + 1);
  for (int i = 0; i <= n; ++i) p3[i] = i == 0 ? 1 : p3[i - 1] * 3;
  vector<int> c(n);
  vector<int64> dp(1 << len);
  for (int S = 0; S < p3[L]; ++S) {
    for (int i = 0, T = S; i < L; ++i, T /= 3) c[i] = T % 3;
    bool ok = 1;
    for (int i = 0; i < L && ok; ++i) {
      for (int j = i + 1; j < L && ok; ++j) {
        if (g[i * 3 + c[i]][j * 3 + c[j]]) ok = 0;
      }
    }
    if (!ok) continue;
    int maskR = 0;
    for (int i = 0; i < L; ++i) {
      int x = i * 3 + c[i];
      for (int y = 3 * L; y < 3 * n; ++y) {
        if (g[x][y]) {
          int j = y / 3 - L, cj = y % 3;
          maskR |= (1 << cj) << (j * 3);
        }
      }
    }
    maskR = (1 << len) - 1 - maskR;
    // trace(S, maskR, len);
    dp[maskR]++;
  }
  trace("L done", len);
  for (int i = 0; i < len; ++i) {
    for (int S = (1 << len) - 1; S >= 0; --S) {
      if ((S >> i) & 1) dp[S ^ (1 << i)] += dp[S];
    }
  }
  trace("sos done", dp[0], dp[(1 << len) - 1]);
  int64 ret = 0;
  for (int S = 0; S < p3[R]; ++S) {
    for (int i = 0, T = S; i < R; ++i, T /= 3) c[L + i] = T % 3;
    bool ok = 1;
    for (int i = L; i < n && ok; ++i) {
      for (int j = i + 1; j < n && ok; ++j) {
        if (g[i * 3 + c[i]][j * 3 + c[j]]) ok = 0;
      }
    }
    if (!ok) continue;
    int maskR = 0;
    for (int i = 0; i < R; ++i) maskR |= (1 << c[L + i]) << (3 * i);
    ret += dp[maskR];
  }
  cout << ret << '\n';

  return 0;
}