#include<cstdio>
#include<algorithm> 
#include<cstring>
#define S 32768
#define G 3
using namespace std;const int P=998244353;
int rev[S],w[2][S],A[S],B[S],f[31][S],ans[5][S],sum[S];
char str[S];int pow[S],_pow[S],x[5],y[5];
int i,N,T,AA,BB,q,n,kth,m;
inline int Pow(int a,int b)
{
  int res=1;
  for (;b;b>>=1,a=a*1ll*a%P) 
        if (b&1) res=res*1ll*a%P;
  return res;
}
inline void NTT(int *a,int o)
{
  for (int i=0;i<N;i++)
    if (i<rev[i]) swap(a[i],a[rev[i]]);
  for (int i=1;i<N;i<<=1)
    for (int j=0,t=N/(i<<1);j<N;j+=i<<1)
      for (int k=0,l=0;k<i;k++,l+=t)
      {
        int x=a[j+k+i]*1ll*w[o][l]%P;
        int y=a[j+k];
        a[j+k+i]=(y-x<0)?y-x+P:y-x;
        a[j+k]=(y+x>=P)?y+x-P:y+x;
      }
  if (o) 
  {
    int x=Pow(N,P-2);
    for (int i=0;i<N;i++) a[i]=a[i]*1ll*x%P;
  }
}
inline void Init(int n)
{
  for (N=1;N<=n;N<<=1);N<<=1;
  for (int i=0;i<N;i++)
  {
    int x=i,&y=rev[i];
    for (int k=1;k<N;k<<=1,x>>=1) (y<<=1)|=x&1;
  }
  w[0][0]=w[1][0]=1;int x=Pow(G,(P-1)/N),y=Pow(x,P-2);
  for (int i=1;i<N;i++)
    w[0][i]=w[0][i-1]*1ll*x%P,w[1][i]=w[1][i-1]*1ll*y%P;
}
#define mem(a) for (int _=0;_<N;_++) a[_]=0
inline void Get(int k,int *ans)
{
  int num=x[k];
  for (int i=0;i<=n;i++) pow[i]=Pow(num,i);
  for (int i=0;i<=n;i++) _pow[i]=Pow(pow[i],q);
  int sum=0;
  for (int i=0;i<=n;i++) sum+=_pow[i],sum%=P,f[0][i]=sum;
  for (int i=1;i<=30;i++)
  {
    mem(A);
    for (int j=0;j<=n;j++) A[j]=f[i-1][j];
    NTT(A,0);
    for (int j=0;j<N;j++) f[i][j]=A[j]*1ll*A[j]%P;
    NTT(f[i],1);
    for (int j=n+1;j<N;j++) f[i][j]=0;
  }
  int flag=0;
  for (int i=30;i>=0;i--)
    if ((kth>>i)&1) 
    {
      if (!flag) 
      {
        for (int j=0;j<=n;j++) 
          ans[j]=f[i][j];
        flag=1;continue;
      }
      mem(A);mem(B);
      for (int j=0;j<=n;j++) A[j]=ans[j],B[j]=f[i][j];
      NTT(A,0);
      NTT(B,0);
      for (int j=0;j<N;j++) A[j]=A[j]*1ll*B[j]%P;
      NTT(A,1);
      for (int j=0;j<=n;j++) ans[j]=A[j];
    }
}
inline void Calc(int *y)
{
  int res=1;
  for (int i=0;i<m;i++)
    res=res*1ll*ans[i][y[i]]%P;
  printf("%d\n",res);
}
int main()
{
  scanf("%d%d",&kth,&q);
  Init(n=10000);
    scanf("%d",&m);
    for (i=0;i<m;i++)
        scanf("%d%d",&AA,&BB),x[i]=AA,y[i]=BB;
    for (int i=0;i<m;i++) 
        Get(i,ans[i]);
    Calc(y);
}