// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 1005, M = 5005, P = 1e9 + 7;

int n, m, q, f[N], g[N], pw[N];

// f È« 1£» g È« 0 

bitset<M> a[N], r[N], st, fl, bk[N], qz;

char s[M];

void inline add(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}


int ask(int n) {
	if (fl.none()) return pw[n];
	if (!n) {
		if (st.count()) return 0;
		return 1;
	}
	if (st.count() == 0) {
		if ((a[n] & fl).none()) {
			return (pw[n - 1] + ask(n - 1)) % P;
		} else {
			fl &= a[n];
			st &= a[n];
			return ask(n - 1);
		}
	} else if (st == fl) {
		if ((~a[n] & fl).none()) {
			return (pw[n - 1] + ask(n - 1)) % P;
		} else {
			fl &= (~a[n]);
			st &= (~a[n]);
			return ask(n - 1);
		}
	} else {
		if (st == (fl & a[n])) {
			int ret = 0;
			bk[n] = fl ^ st;
			fl = st;
			add(ret, ask(n - 1));
			fl = bk[n];
			st.reset();
			add(ret, ask(n - 1));
			return ret;
		} else if (((a[n] & fl) & st) == (a[n] & fl)) {
			fl &= (~a[n]);
			st &= (~a[n]);
			return ask(n - 1);
		} else if ((st & (~a[n])).none()) {
			fl &= a[n];
			st &= a[n];
			return ask(n - 1);
		} 
	}
	return 0;
}

int ans[N];

int main() {
	pw[0] = 1;
	read(n), read(m), read(q);
	for (int i = 1; i <= n; i++) {
		pw[i] = pw[i - 1] * 2 % P;
		scanf("%s", s + 1);
		for (int j = 1; j <= m; j++)
			if (s[j] == '1') a[i][j] = 1; 
	}
	for (int i = 1; i <= q; i++) {
		scanf("%s", s + 1);
		for (int j = 1; j <= m; j++)
			if (s[j] == '1') r[i][j] = 1; 
	}
	
	for (int i = 1; i <= q; i++) {
		if (i > 1 && r[i] == r[i - 1]) {
			printf("%d\n", ans[i] = ans[i - 1]);
			continue;
		}
		st = r[i];
		fl.reset();
		for (int j = 1; j <= m; j++) fl[j] = 1;
		printf("%d\n", ans[i] = ask(n));
	}
    return 0;
}