Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

// 文字列を1行取得
func StrStdin() (stringReturned string) {
//	scanner := bufio.NewScanner(os.Stdin)

	scanner.Scan()
	stringInput := scanner.Text()

	stringReturned = strings.TrimSpace(stringInput)
	return
}

// 整数値1つ取得
func IntStdin() (int, error) {
	stringInput := StrStdin()
	return strconv.Atoi(strings.TrimSpace(stringInput))
}

// 空白や空文字だけの値を除去したSplit()
func SplitWithoutEmpty(stringTargeted string, delim string) (stringReturned []string) {
	stringSplited := strings.Split(stringTargeted, delim)

	for _, str := range stringSplited {
		if str != "" {
			stringReturned = append(stringReturned, str)
		}
	}

	return
}

// デリミタで分割して文字列スライスを取得
func SplitStrStdin(delim string) (stringReturned []string) {
	// 文字列で1行取得
	stringInput := StrStdin()

	// 空白で分割
	// stringSplited := strings.Split(stringInput, delim)
	stringReturned = SplitWithoutEmpty(stringInput, delim)

	return
}

// デリミタで分割して整数値スライスを取得
func SplitIntStdin(delim string) (intSlices []int, err error) {
	// 文字列スライスを取得
	stringSplited := SplitStrStdin(" ")

	// 整数スライスに保存
	for i := range stringSplited {
		var iparam int
		iparam, err = strconv.Atoi(stringSplited[i])
		if err != nil {
			return
		}
		intSlices = append(intSlices, iparam)
	}
	return
}

func main() {
	nk, _ := SplitIntStdin(" ")
	n, k := nk[0], nk[1]
	kind := make([]int, n)
	for i := 0; i < k; i++ {
		var tmp []int
		var err error
		if tmp, err = SplitIntStdin(" "); err != nil {
			panic(err)
		}
		kind[tmp[0]-1] = tmp[1]
	}
	dp := make([][3][3]int, n)
	if kind[0] > 0 {
		dp[0][0][kind[0]-1] = 1
	} else {
		for i := 0; i < 3; i++ {
			dp[0][0][i] = 1
		}
	}
	if kind[1] > 0 {
		for i := 0; i < 3; i++ {
			dp[1][i][kind[1]-1] = dp[0][0][i]
		}
	} else {
		for i := 0; i < 3; i++ {
			for j := 0; j < 3; j++ {
				dp[1][i][j] = dp[0][0][i]
			}
		}
	}
	for i := 1; i < n-1; i++ {
		if kind[i+1] > 0 {
			for j := 0; j < 3; j++ {
				if j == kind[i+1]-1 {
					for k := 0; k < 3; k++ {
						if j != k {
							dp[i+1][j][kind[i+1]-1] += dp[i][k][j]
							dp[i+1][j][kind[i+1]-1] %= 10000
						}
					}
				} else {
					for k := 0; k < 3; k++ {
						dp[i+1][j][kind[i+1]-1] += dp[i][k][j]
						dp[i+1][j][kind[i+1]-1] %= 10000
					}
				}
			}
		} else {
			for j := 0; j < 3; j++ {
				for k := 0; k < 3; k++ {
					for l := 0; l < 3; l++ {
						if j != k || k != l {
							dp[i+1][k][j] += dp[i][l][k]
							dp[i+1][k][j] %= 10000
						}
					}
				}
			}
		}
	}
	result := 0
	for i := 0; i < 3; i++ {
		for j := 0; j < 3; j++ {
			result += dp[n-1][i][j]
		}
	}
	// fmt.Println(dp)
	// fmt.Println(kind)
	fmt.Println(result % 10000)
}

C++: //============================================================================
// Name        : JOI.cpp
// Author      :
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

// 1. dp?????????
//???????????\???????????\
//?????????????????????????????????
//?????????????????????????????????
//?????????????????????????????????
//?????????????????????????????????
//?????????????????????????????????
//?????????????????????????????????
//?????????????????????????????????
//?????????????????????????????????
//?????????????????????????????????

int dp[10][101];
// 2. n?????????
int N,K;
int A;
int B;
// 7. calc?????????
int calc(int i,int m){
	// 8. dp???????????°??????
	if(dp[i][m]>=0)return dp[i][m];
	// 9. dp????¨????

	if(i==1)dp[i][m]=calc(4,m-1)+calc(7,m-1);
	if(i==2 || i==3)dp[i][m]=calc(1,m-1)+calc(4,m-1)+calc(7,m-1);
	if(i==4 ||i==6)dp[i][m]=calc(2,m-1)+calc(5,m-1)+calc(8,m-1);
	if(i==5)dp[i][m]=calc(2,m-1)+calc(8,m-1);
	if(i==7 || i==8)dp[i][m]=calc(3,m-1)+calc(6,m-1)+calc(9,m-1);
	if(i==9)dp[i][m]=calc(3,m-1)+calc(6,m-1);
	dp[i][m]=dp[i][m]%10000;
	return dp[i][m];
}
int main() {
	cin>>N>>K;

	//3.?????????
	for(int i=0;i<10;i++){
		for(int j=0;j<101;j++){
			dp[i][j]=-1;
		}
	}
	//4.??\???
	for(int i=0;i<K;i++){
		cin>>A>>B;
		if(B==1){
			dp[2][A]=0;
			dp[3][A]=0;
			dp[5][A]=0;
			dp[6][A]=0;
			dp[8][A]=0;
			dp[9][A]=0;
		}
		if(B==2){
			dp[1][A]=0;
			dp[3][A]=0;
			dp[4][A]=0;
			dp[6][A]=0;
			dp[7][A]=0;
			dp[9][A]=0;
		}
		if(B==3){
			dp[1][A]=0;
			dp[2][A]=0;
			dp[4][A]=0;
			dp[5][A]=0;
			dp[7][A]=0;
			dp[8][A]=0;
		}
	}

	//5.???????????¨???

	if(dp[1][1]<0&&dp[1][2]<0)dp[1][2]=1;
	if(dp[1][1]<0&&dp[2][2]<0)dp[2][2]=1;
	if(dp[1][1]<0&&dp[3][2]<0)dp[3][2]=1;
	if(dp[2][1]<0&&dp[4][2]<0)dp[4][2]=1;
	if(dp[2][1]<0&&dp[5][2]<0)dp[5][2]=1;
	if(dp[2][1]<0&&dp[6][2]<0)dp[6][2]=1;
	if(dp[3][1]<0&&dp[7][2]<0)dp[7][2]=1;
	if(dp[3][1]<0&&dp[8][2]<0)dp[8][2]=1;
	if(dp[3][1]<0&&dp[9][2]<0)dp[9][2]=1;
	//6.??????
	int total=0;
	for(int i=1;i<10;i++){
		total+=calc(i,N);
	}
	total=total%10000;
	cout<<total<<endl;



	return 0;
}

C++: #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
typedef long long int lli;
using namespace std;

/*
int dp[101][4][4];
int sche[101];

int main(){
	for(int i=0; i<101; ++i){
		sche[i]=-1;
		for(int j=0; j<4; ++j){
			for(int k=0; k<4; ++ k){
				dp[i][j][k]=-1;
			}
		}
	}
	int N,K;
	cin >> N >> K;
	for(int i=0; i<K; ++i){
		int A,B;
		cin >> A >> B;
		sche[A]=B;
	}
	for(int i=1; i<2; ++i){
		if(sche[i]!=-1){
			dp[i][sche[i]][0]=1;
		}else{
			for(int j=1; j<4; ++j){
				for(int k=1; k<4; ++k){
					dp[i][j][k]=1;
				}
			}
		}
	}
	for(int i=3; i<=N; ++i){
		if(sche[i]!=-1){
			for(int j=1; j<4; ++j){
				dp[i][sche[i]][j]=1;;
			}
		} else {
			for(int j=1; j<4; ++j){
				for(int k=1; k<4; ++k){
						
				}
			}
		}
	}
	return 0;
}
*/

int dp[101][4][4];
int sche[101];
int main(){
	for(int i=0; i<101; ++i){
		sche[i]=-1;
		for(int j=0; j<4; ++j){
			for(int k=0; k<4; ++k){
				dp[i][j][k]=0;
			}
		}
	}
	int N,K;
	cin >> N >> K;
	for(int i=0; i<K; ++i){
		int A,B;
		cin >> A >> B;
		sche[A]=B;
	}
	if(sche[1]!=-1){
		dp[1][sche[1]][1]=1;
	} else {
		for(int i=1; i<4; ++i){
			dp[1][i][1]=1;
		}
	}
	for(int i=2; i<=N; ++i){
		if(sche[i]!=-1){
			for(int j=1; j<4; ++j){
				if(sche[i]!=j){
					/*if(dp[i][sche[i]][1]+dp[i-1][j][1]+dp[i-1][j][2]>=dp[i][sche[i]][1])*/ dp[i][sche[i]][1]+=dp[i-1][j][1]+dp[i-1][j][2];
					//if(dp[i][sche[i]][2]+dp[i-1][j][1]+dp[i-1][j][2]>=dp[i][sche[i]][2]) dp[i][sche[i]][2]+=dp[i-1][j][1]+dp[i-1][j][2];
				}else {
					/*if(dp[i][sche[i]][2]+dp[i-1][j][1]>=dp[i][sche[i]][2])*/ dp[i][sche[i]][2]+=dp[i-1][j][1];
				}
			}
		} else	{
			for(int j=1; j<4; ++j){
				for(int k=1; k<4; ++k){
					if(j!=k){
						/*if(dp[i][j][1]+dp[i-1][k][1]+dp[i-1][k][2]>=dp[i][j][1])*/ dp[i][j][1]+=dp[i-1][k][1]+dp[i-1][k][2];
						//if(dp[i][j][2]+dp[i-1][k][1]+dp[i-1][k][2]>=dp[i][j][2]) dp[i][j][2]+=dp[i-1][k][1]+dp[i-1][k][2];
					} else{
						/*if(dp[i][j][2]+dp[i-1][k][1]>=dp[i][j][2])*/dp[i][j][2]+=dp[i-1][k][1];
					}
				}
			}
		}
	}
	int ans=0;
	for(int i=1;i<4; ++i){
		for(int j=1; j<3; ++j){
			//cout << dp[N][i][j] << "\n";
			int tmp=ans;
			tmp+=dp[N][i][j];
			ans=tmp%10000;
		}
	}
	cout << ans << "\n";
	return 0;
}