//
//  na 2718.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/18.
//
#ifndef MAC_OS_VERSION_11_0
#pragma GCC optimize("Ofast")
#endif
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <random>
using namespace std;
typedef long long int ll;
const int maxn = 4, maxs = 16, maxq = 1e5, mod = 998244353;
inline void add(int &a, int b){
    if((a += b) >= mod)
        a -= mod;
}
inline int mul(int a, int b){
    return ll(a) * b % mod;
}
struct Mat{
    int m[maxn][maxn], w, h;
    Mat(int w, int h): w(w), h(h) {
        for(int i = 0; i < h; ++i)
            for(int j = 0; j < w; ++j)
                m[i][j] = 0;
    }
    Mat(){}
    inline Mat operator * (const Mat &other) const{
        Mat res(other.w, h);
        for(int i = 0; i < res.h; ++i)
            for(int j = 0; j < res.w; ++j){
                for(int k = 0; k < w; ++k)
                    add(res.m[i][j], mul(m[i][k], other.m[k][j]));
            }
        return res;
    }
    inline void print(){
        cerr << "[";
        for(int i = 0; i < h; ++i){
            cerr << " ";
            for(int j = 0; j < w; ++j)
                cerr << setw(4) << m[i][j];
            if(i != h - 1)
                cerr << endl;
        }
        cerr << "   ]" << endl;
    }
} states[maxs][maxs], sstate(4, 1), unit;
inline Mat qpow(Mat base, int exp){
    Mat res = unit;
    while(exp){
        if(exp & 1)
            res = res * base;
        base = base * base;
        exp >>= 1;
    }
    return res;
}
int n, m, q, k;
namespace segtree{
struct Node{
    int lt, rt, mid, lstate, rstate;
    Mat res;
    Node *lc, *rc;
    Node(int lt, int rt): lt(lt), rt(rt), mid((lt + rt) >> 1), lc(nullptr), rc(nullptr) {}
    inline void update(){ // non leaf
//        cerr << "update: " << lt << " -> " << rt << endl;
        lstate = lc == nullptr? 0: lc->lstate;
        rstate = rc == nullptr? 0: rc->rstate;
//        cerr << "ls = " << lstate << ", rs = " << rstate << endl;
        res = (lc == nullptr? qpow(states[0][0], mid - lt): lc->res) *
              states[lc == nullptr? 0: lc->rstate][rc == nullptr? 0: rc->lstate] *
              (rc == nullptr? qpow(states[0][0], rt - mid - 1): rc->res);
//        cerr << "res: " << endl;
//        res.print();
    }
};
inline void change(int &x, int &y, Node* cur){
//    cerr << "change: " << cur->lt << " -> " << cur->rt << endl;
    if(cur->lt == cur->rt){
        cur->lstate = cur->rstate = cur->lstate | (1 << y);
        cur->res = unit;
        return;
    }
    if(x <= cur->mid){
        if(cur->lc == nullptr)
            cur->lc = new Node(cur->lt, cur->mid);
        change(x, y, cur->lc);
    }else{
        if(cur->rc == nullptr)
            cur->rc = new Node(cur->mid + 1, cur->rt);
        change(x, y, cur->rc);
    }
    cur->update();
}
}
using segtree::Node; using segtree::change;
inline void qread(int &var){
    var = 0;
    char reg = getchar();
    while(reg - 48 >= 10u)
        reg = getchar();
    do{
        var = (var << 1) + (var << 3) + (reg ^ 48);
        reg = getchar();
    }while(reg - 48 < 10u);
}
namespace qwritesp{
char buf[15];
inline void qwrite(int val){
    int p = 0, tmp;
    while(val){
        tmp = val / 10;
        buf[p++] = (val - tmp * 10) ^ 48;
        val = tmp;
    }
    for(int i = 0; i < p; ++i)
        putchar(buf[i]);
    if(!p)
        putchar(48);
}
}
using qwritesp::qwrite;
#ifdef MAC_OS_VERSION_11_0
#define RNDDATA
#endif
#ifdef RNDDATA
random_device rd;
mt19937 rnd(rd());
#endif
int main(){
    cin.tie(0)->sync_with_stdio(false);
//    cin >> n >> m >> q;
    qread(n); qread(m); qread(q);
#ifdef MAC_OS_VERSION_11_0
    time_t st = clock();
#endif
    unit = Mat(n, n);
    for(int i = 0; i < n; ++i)
        unit.m[i][i] = true;
    k = 1 << n;
    sstate.m[0][0] = true;
    for(int ss = 0; ss < k; ++ss)
        for(int ns = 0; ns < k; ++ns){
            states[ss][ns] = Mat(n, n);
            for(int i = 0; i < n; ++i)
                if((~ss & ~ns) & (1 << i)){
                    if(i && (~ss & (1 << (i - 1))))
                        states[ss][ns].m[i - 1][i] = true;
                    if(i != n - 1 && (~ss & (1 << (i + 1))))
                        states[ss][ns].m[i + 1][i] = true;
                }
        }
    Node *root = new Node(1, m + 1);
    root->update();
//    cerr << "root: " << endl;
//    root->res.print();
//    cerr << "emp: " << (sstate * root->res).m[0][n - 1] << endl;
    int x, y;
    while(q--){
#ifdef RNDDATA
        x = rnd() % m + 1;
        y = rnd() % n + 1;
#else
//        cin >> y >> x;
        qread(y); qread(x);
#endif
//        cerr << x << ", " << y << endl;
        --y;
        change(x, y, root);
//        cerr << "root: " << endl;
//        root->res.print();
#ifndef RNDDATA
//        cout << (sstate * root->res).m[0][n - 1] << endl;
        qwrite((sstate * root->res).m[0][n - 1]);
        putchar('\n');
#endif
    }
#ifdef MAC_OS_VERSION_11_0
    cerr << double(clock() - st) / CLOCKS_PER_SEC * 1000 << endl;
#endif
    fflush(stdout);
    return 0;
}