#include<bits/stdc++.h>
using namespace std;
//typedef long long ll;
const int mod = 998244353;
const int MAXN =2e5+10;
int f[6][MAXN];
bool is[6][MAXN];
int n,m;
int calc(){
    memset(f,0,sizeof(f));
    if(is[1][1])return 0;
    if(is[2][1])return 0;
    f[2][1]=1;
    for(int j=2;j<=m;++j){
        for(int i=1;i<=n;++i){
            if(is[i][j])continue;
            if(!is[i-1][j])f[i][j]=(f[i][j]+f[i-1][j-1])%mod;
            if(!is[i+1][j])f[i][j]=(f[i][j]+f[i+1][j-1])%mod;
        }
        bool sus=0;
        for(int i=1;i<=n;++i)if(f[i][j])sus=1;
        if(sus==0)return 0;
    }
    return f[n][m];
}
bool fail;
int q;
int main(){
    scanf("%d%d%d",&n,&m,&q);
    while(q--){
        int x,y;scanf("%d%d",&x,&y);
        is[x][y]=1;
        if(fail){
            puts("0");continue;
        }
        int ans=calc();
        if(ans==0)fail=1;
        printf("%d\n",ans);
    }
    return 0;
}