#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){

	// n >= 7
	ll n, m, k; cin >> n >> m >> k;
	vector<ll> c(k);
	
	// jump 1 time
	vector mat(60, vector(6, vector<mint>(6)));
	rep(i,0,5){
		mat[0][i][i+1] = 1;
	}
	rep(i,0,6){
		mat[0][5][i] = 1;
	}
	rep(num,0,59){
		rep(i,0,6){
			rep(j,0,6){
				rep(k,0,6){
					mat[num+1][i][j] += mat[num][i][k] * mat[num][k][j];
				}
			}
		}
	}

	// jumpover!
	vector jumpover(6, vector<mint>(6));
	rep(i,0,6){
		vector<mint> dp(13);
		dp[i] = 1;
		rep(j,0,13){
			if (j == 6) continue;
			rep(k,j-6,j){
				if (k < 0) continue;
				dp[j] += dp[k];
			}
		}
		rep(j,0,6){
			jumpover[j][i] = dp[j+7];
		}
	}

	// jump n-7 times, and jump one more time
	vector m_seni(30, vector(6, vector<mint>(6)));
	rep(i,0,6){
		vector<mint> a(6);
		a[i] = 1;
		rep(num,0,30){
			if ((n-7)>>num&1){
				vector<mint> na(6);
				rep(x,0,6){
					rep(y,0,6){
						na[x] += mat[num][x][y] * a[y];
					}
				}
				swap(a, na);
			}
		}
		vector<mint> na(6);
		rep(x,0,6){
			rep(y,0,6){
				na[x] += jumpover[x][y] * a[y];
			}
		}
		swap(a, na);
		rep(x,0,6){
			m_seni[0][x][i] = a[x];
		}
	}

	rep(num,0,29){
		rep(i,0,6){
			rep(j,0,6){
				rep(k,0,6){
					m_seni[num+1][i][j] += m_seni[num][i][k] * m_seni[num][k][j];
				}
			}
		}
	}

	// 最終局面：愚直！端にきているとする.
	vector<mint> last(6);
	rep(x,0,6){
		vector<mint> dp(7);
		dp[x] = 1;
		rep(i,0,6){
			rep(j,1,7){
				dp[min(6,i+j)] += dp[i];
			}
		}
		last[x] = dp[6];
	}

	mint alls = 0;
	{
		vector<mint> a(6);
		a[5] = 1;
		rep(num,0,60){
			if ((n*m-1)>>num&1){
				vector<mint> na(6);
				rep(i,0,6){
					rep(j,0,6){
						na[i] += mat[num][i][j] * a[j];
					}
				}
				swap(a, na);
			}
		}
		rep(i,0,6){
			alls += a[i] * (i+1);
		}
	}

	auto solve = [&](ll x) -> mint {
		vector<mint> a(6);
		a[5] = 1;

		// 最初のジャンプまで
		rep(num,0,30){
			if ((x-1)>>num&1){
				vector<mint> na(6);
				rep(i,0,6){
					rep(j,0,6){
						na[i] += mat[num][i][j] * a[j];
					}
				}
				swap(na, a);
			}
		}

		// ジャンプ！
		vector<mint> na(6);
		rep(x,0,6){
			rep(y,0,6){
				na[x] += jumpover[x][y] * a[y];
			}
		}
		swap(a, na);

		// m-1 回ジャンプ 
		rep(num,0,30){
			if ((m-1)>>num&1){
				vector<mint> na(6);
				rep(i,0,6){
					rep(j,0,6){
						na[i] += mat[num][i][j] * a[j];
					}
				}
				swap(na, a);
			}
		}
		
		// 今の限界... i = c[i]+6 (mod n)
		// i = n-1 まで飛ぶ
		// n-7-c[i]
		// n-7-c[i] 回ジャンプ


		if (n-7-x < 0){
			cout << "kita" << endl;
			ll f = x+7-n;
			a.resize(6-f);
			reverse(a.begin(), a.end());
			rep(j,0,f)a.push_back(0);
			reverse(a.begin(), a.end());			
		}else{
			rep(num,0,30){
				if ((n-7-x)>>num&1){
					vector<mint> na(6);
					rep(i,0,6){
						rep(j,0,6){
							na[i] += mat[num][i][j] * a[j];
						}
					}
					swap(na, a);
				}
			}
		}
		mint ans = alls;
		rep(i,0,6){
			ans -= a[i] * (i+1);
		}



		return ans;
	};

	rep(i,0,k){
		cin >> c[i];
		cout << solve(c[i]).val() << '\n';
	}

}