#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 10000;
const ll inf = 1e18;
const double PI = acos(-1);

// i : day
// j : eat today
// k : eat yesterday
ll dp[110][4][4];
// j, kにて、0:3種類以外の何か
// 1 : tomato
// 2 : creme
// 3 : bazil

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, K;
    cin >> N >> K;

    VI plan(N, -1);
    rep(i, K){
      ll day, kind;
      cin >> day >> kind;
      day--;
      plan[day] = kind;
    }
    debug(plan);

    // 0日目
    if(plan[0]==-1){
      dp[0][1][0] = 1;
      dp[0][2][0] = 1;
      dp[0][3][0] = 1;
    }else{
      ll k = plan[0];
      dp[0][k][0] = 1;
    }

    debug(dp[0][1][0]);
    debug(dp[0][2][0]);
    debug(dp[0][3][0]);
    debug(".");

    // 1日目
    if(plan[1]==-1){
      debug("here");
      dp[1][1][1] = dp[0][1][0];
      dp[1][1][2] = dp[0][2][0];
      dp[1][1][3] = dp[0][3][0];

      dp[1][2][1] = dp[0][1][0];
      dp[1][2][2] = dp[0][2][0];
      dp[1][2][3] = dp[0][3][0];
      
      dp[1][3][1] = dp[0][1][0];
      dp[1][3][2] = dp[0][2][0];
      dp[1][3][3] = dp[0][3][0];
    }
    else{
      ll k = plan[1];
      dp[1][k][1] = dp[0][1][0];
      dp[1][k][2] = dp[0][2][0];
      dp[1][k][3] = dp[0][3][0];
    }

    debug(dp[1][1][1]);
    debug(dp[1][2][1]);
    debug(dp[1][3][1]);
    debug(dp[1][1][2]);
    debug(dp[1][2][2]);
    debug(dp[1][3][2]);

    FOR(i, 2, N){
      ll k = plan[i];
      if(k==-1){
        // ノープラン
        
        // 例
        //dp[i][1][1] = dp[i-1][1][1] + dp[i-1][1][2] + dp[i-1][1][3];
        
        FOR(eat, 1, 4){
          FOR(zenkai, 1, 4){
            FOR(j, 1, 4){
              if(eat==zenkai && zenkai==j) continue;
              dp[i][eat][zenkai] += dp[i-1][zenkai][j];
              dp[i][eat][zenkai] %= mod;
            }
          }
        }
      }
      else{
        FOR(eat, 1, 4){
          FOR(zenkai, 1, 4){
            FOR(j, 1, 4){
              if(eat==zenkai && zenkai==j) continue;
              dp[i][eat][zenkai] += dp[i-1][zenkai][j];
              dp[i][eat][zenkai] %= mod;
            }
          }
        }
        FOR(eat, 1, 4){
          if(eat!=k){
            FOR(j, 1, 4){
              dp[i][eat][j] = 0;
            }
          }
        }
      }
    }

    ll sum = 0;
    FOR(i, 1, 4){
      FOR(j, 1, 4){
        sum += dp[N-1][i][j];
        sum %= mod;
      }
    }
    p(sum);
    
    return 0;
}


Measured memory_bytes: 3220