#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};
combi C(5000000);

int main(){
	int H,W,q;
	cin>>H>>W>>q;
	rep(_,q){
		int t;
		cin>>t;
		{
			long long v = H;
			v += t;
			v -= W;
			v *= t;
			if(v<=0){
				cout<<0<<endl;
				continue;
			}
		}
		mint ans = C.junretsu(H,W);
		int x,y;
		if(t>=0){
			x = t;
			y = -t;
			swap(x,y);
		}
		else{
			t *= -1;
			x = t;
			y = -t;
		}
		if(x<=H&&y<=W)ans -= C.junretsu(H-x,W-y);
		cout<<ans.val()<<endl;
		
	}
	
	return 0;
}