#include<bits/stdc++.h>
using namespace std;
int n, m, q, s[1010], p[1001000] = {0}, v[1001000], a[5100][5100], num[5100][5100];
long long P = 0;
const int MOD = 100000000;
int prime() {
	int j = 0;
	for(int i = 2; i <= 1000000; i ++) {
		if(v[i] == 0) {
			v[i] = i;
			p[++ j] = i;
		}
		for(int k = 1; k <= j; k ++) {
			if(p[k] > v[i] || p[k] > 1000000 / i) {
				break;
			}
			v[i * p[k]] = p[k];
		}
	}
}
int main() {
    freopen("mathproblem.in", "r", stdin);
    freopen("mathproblem.out", "w", stdout);
    cin >> n >> m >> q;
    prime();
    a[0][0] = 1;
    for(int i = 1; i <= n; i ++) {
    	a[i][i] = 1;
    	a[i][0] = 1;
    	for(int j = 1; j <= min(i, n); j ++) {
    		a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
		}
	}
	for(int i = 1; i <= n; i ++) {
		if(n % i == 0) {
			P += a[n][i];
		}
	}
    for(int i = 1; i <= q; i ++) {
    	long long x, mod = 1;
    	cin >> x;
    	for(int j = 1; j <= x; j ++) {
    		cin >> s[i];
    		mod *= p[s[i]];
		}
		cout << P % mod << endl;
	}
    return 0;
}