#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
const int mod=998244353;
ll n,m,k;
ll ksm(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1)ans=(ans*a)%mod;
		a=(a*a)%mod;
		b>>=1;
	}
	return ans;
}
int main(){
	freopen("plusminus.in","r",stdin); 
	freopen("plusminus.out","w",stdout);
	scanf("%lld %lld",&n,&m);
	scanf("%lld",&k);
	for(int i=1,x,y;i<=k;i++){
		scanf("%d %d",&x,&y);
	}
	if((n&1)==(m&1))printf("%lld\n",ksm(2,n*m-n-m-k+1));
	else printf("0\n");
	return 0;
}