#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
const ll inf = 4611686018427387903LL;
const int MOD=998244353;
ll dp1[2001][2001][2];//縦
ll dp2[2001][2001][2];//斜め
ll mp(ll x,ll n){
  if(n==0)return 1;
  if(n%2==0)return mp((x*x)%MOD,n/2);
  return (x*mp(x,n-1))%MOD;
}
int main()
{
  int N,K,M;
  cin >> N >> K;
  cin >> M;
  vector<int>R(K+1,-1);
  rep(i,M){
    int l,r;
    cin >> l >> r;
    R[r]=max(R[r],l);
  }
  for(int i=K;i>=1;i--){
    bool ok=true;
    for(int j=i-1;j>=0;j--){
      ok&=(R[j]<R[i]);
    }
    if(!ok)R[i]=-1;
  }
  dp1[0][0][0]=dp2[0][0][0]=1;
  for(int j=1;j<=K;j++){
    for(int k=0;k<=K;k++){
      ll nx[2]={0,0};
      if(R[j]!=-1&&k>0){
        int L=R[j];
        for(int l=0;l<2;l++){
          nx[l]+=dp2[j-1][k-1][l^1];
          if(k-(j-L)-1>=0)nx[l]-=dp2[L-1][k-(j-L)-1][l^1];

          if(k-(j-L)-1>=0)nx[l]+=dp1[L-1][k-(j-L)-1][l^1];
          nx[l]%=MOD;
          if(nx[l]<0)nx[l]+=MOD;
        }
      }

      for(int l=0;l<2;l++){
        dp1[j][k][l]=(dp1[j-1][k][l]+nx[l])%MOD;
        dp2[j][k][l]=nx[l];
        if(j-1>=0&&k-1>=0)dp2[j][k][l]+=dp2[j-1][k-1][l];
        dp2[j][k][l]%=MOD;
      }
    }
  }
  ll ans=0;
  for(int i=0;i<=K;i++){
    ans+=(dp1[K][i][0]-dp1[K][i][1]+MOD)*mp(K-i,N);
    ans%=MOD;
  }
  cout << ans << endl;
  return 0;
}