#include<iostream>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<fstream>
#include<algorithm>
#include<unordered_set>
#include<iomanip>
#include<set>

using namespace std;

const int MOD = 1e9 + 7;


int mod(int n) {
    if (n >= MOD) {
        return n % MOD;
    }
    return n;
}

int main() {
    int n, k;
    cin >> n >> k;
   // vector<vector<bool> > used(2, vector<bool> (n + 1, false));
    vector<int> v(n);
    for (int i = 0; i < k; ++i) {
        int x, y;
        cin >> x >> y;
        --x;
        if (y == 2) {
            y = 0;
        }
        v[x] |= (1 << y);
    }
    /*for (int i = 1; i <= n; ++i){
        cout << v[i] << " ";
    }
    cout << endl;*/
    vector<vector<int> > dp(n, vector<int> (4));
    for (int mask = v[1]; mask < 4; ++mask) {
        if (mask == 0) {
            if (v[0] == 0) {
                dp[0][mask] = 2;
            } else {
                dp[0][mask] = 1;
            }
        }
        if (mask == 1) {
            if (v[0] == 1 || v[0] == 3) {
                dp[0][mask] = 0;
            } else {
                dp[0][mask] = 1;
            }
        }
        if (mask == 2) {
            if (v[0] == 2 && v[0] == 3) {
                dp[0][mask] = 0;
            } else {
                dp[0][mask] = 1;
            }
        }
        if (mask == 3 && v[0] == 0) {
            dp[0][mask] = 1;
        }
    }

    for (int i = 1; i < n; ++i) {
        for (int mask = v[i + 1]; mask < 4; ++mask) {
            if (mask == 0) {
                dp[i][mask] = mod(mod(mod(2 * dp[i - 1][0]) + dp[i - 1][1]) + mod(dp[i - 1][2] + dp[i - 1][3]));
            }
            if (mask == 1) {
                dp[i][mask] = mod(dp[i - 1][0] + dp[i - 1][2]);
            }
            if (mask == 2) {
                dp[i][mask] = mod(dp[i - 1][0] + dp[i - 1][1]);
            }
            if (mask == 3) {
                dp[i][mask] = dp[i - 1][0];
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < 4; ++mask) {
            cout << dp[i][mask] << " ";
        }
        cout << endl;
    }
    cout << dp[n - 1][0];
    return 0;
}