#include <bits/stdc++.h>
using namespace std;
#define mod 998244353
int n, m, q, r, c;
int a[1007][1007];
bool b[1007][1007];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-') f = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
int main() {
n = read(), m = read();
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
a[i][j] = read();
r = read(), c = read();
for(int i = 1; i <= r; i++)
for(int j = 1; j <= c; j++)
cin >> b[i][j];
q = read();
while(q--) {
int x1 = read(), x2 = read(), y1 = read(), y2 = read();
int sum = 0;
for(int i = x1; i <= x2; i++)
for(int j = y1; j <= y2; j++)
sum = (sum + a[i][j] * b[i - x1 + 1][j - y1 + 1]) % mod;
printf("%d\n", sum);
}
return 0;
}
虽然不能 100,但至少能过一些数据,求调!