#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define SZ(x) ((int) (x).size())
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(x) cerr << "[" << #x << " = " << (x) << "]" << endl
#define left __left
#define right __right
#define prev __prev
#define fi first
#define se second
template <class X, class Y>
bool maximize(X &x, Y y) {
if (x < y) return x = y, true;
else return false;
}
template <class X, class Y>
bool minimize(X &x, Y y) {
if (x > y) return x = y, true;
else return false;
}
int numRow, numCol, numQuery;
#define MAX_N 1'010
int a[MAX_N + 2][MAX_N + 2];
int b[MAX_N + 2];
int main() {
ios_base::sync_with_stdio(false);cin.tie(nullptr);
cin >> numRow >> numCol;
FOR(i, 1, numRow) FOR(j, 1, numCol) cin >> a[i][j];
cin >> numQuery;
while (numQuery--) {
FOR(j, 1, numCol) cin >> b[j];
int ans = 0;
FOR(i, 1, numRow) {
bool ok = true;
FOR(j, 1, numCol) ok &= (b[j] == -1 || a[i][j] == b[j]);
ans += ok;
}
cout << ans << "\n";
}
return 0;
}
/* Discipline - Calm */
