#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define rep(i,x) for(int i=0;i<(x);++i)
#define rep1(i,x) for(int i=1;i<=(x);++i)
#define rrep(i,x) for(int i=(x)-1;i>=0;--i)
#define rrep1(i,x) for(int i=(x);i>=1;--i)
#define int long long
#define FOR(i,a,x) for(int i=(a);i<(x);++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>istream&operator>>(istream&is,vector<T>&vec){rep(i,vec.size())is>>vec[i];return is;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

template<int M>
class mod_int {
    typedef mod_int<M> this_type;

    long long val;

    public:
    mod_int() : val(0) {}
    mod_int(int val) : val(val % M) {}
    mod_int(const this_type& a) : val(a.val) {}

    int value() { return val; }

    operator int() { return val; }

    this_type  operator+ (int a)              { return this_type((val + a % M) % M); }
    this_type  operator- (int a)              { return this_type((val - a % M) % M); }
    this_type  operator* (int a)              { return this_type(val * (a % M) % M); }
    this_type  operator/ (int a)              { return this_type((val / a) % M);     }
    this_type& operator+=(int a)              { return ((val += a % M) %= M, *this); }
    this_type& operator-=(int a)              { return ((val -= a % M) %= M, *this); }
    this_type& operator*=(int a)              { return ((val *= a % M) %= M, *this); }
    this_type& operator/=(int a)              { return ((val /= a) %= M    , *this); }
    this_type  operator+ (const this_type& a) { return this_type((val + a.val % M) % M); }
    this_type  operator- (const this_type& a) { return this_type((val - a.val % M) % M); }
    this_type  operator* (const this_type& a) { return this_type(val * (a.val % M) % M); }
    this_type  operator/ (const this_type& a) { return this_type((val / a.val) % M);     }
    this_type& operator+=(const this_type& a) { return ((val += a.val % M) %= M, *this); }
    this_type& operator-=(const this_type& a) { return ((val -= a.val % M) %= M, *this); }
    this_type& operator*=(const this_type& a) { return ((val *= a.val % M) %= M, *this); }
    this_type& operator/=(const this_type& a) { return ((val /= a.val) %= M    , *this); }

    bool operator<(const this_type& a) const { return val < a.val; }
};

typedef mod_int<10000> ModInt;

ModInt dp[101][3][3];

int N, K;
int sche[101];

signed main()
{
    memset(sche, -1, sizeof(sche));

    cin >> N >> K;

    rep(i, K) {
        int day, source; cin >> day >> source;
        -- day, -- source;
        sche[day] = source;
    }

    if (~sche[0]) {
        dp[0][sche[0]][0] = 1;
    } else {
        rep(i, 3) {
            dp[0][i][0] = 1;
        }
    }

    if (~sche[1]) {
        rep(i, 3) {
            dp[1][sche[1]][i] += dp[0][i][0];
        }
    } else {
        rep(i, 3) {
            rep(j, 3) {
                rep(k, 3) {
                    dp[1][i][j] += dp[0][j][k];
                }
            }
        }
    }

    for (int i = 2; i < N; ++i) {
        if (~sche[i]) {
            rep(j, 3) { // ?????\????????????
                rep(k, 3) { // ????????\????????????
                    if (sche[i] == j && j == k) continue;
                    dp[i][sche[i]][j] += dp[i - 1][j][k];
                }
            }
        } else {
            rep(j, 3) {
                rep(k, 3) {
                    rep(l, 3) {
                        if (j == k && k == l) continue;
                        dp[i][j][k] += dp[i - 1][k][l];
                    }
                }
            }
        }
    }

    ModInt ans = 0;

    rep(i, 3) rep(j, 3) ans += dp[N - 1][i][j];

    cout << ans.value() << endl;
}

Measured memory_bytes: 1164