1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr int MX = 65, MOD = 1e9+7;

ll bs[MX], s[MX], bt[MX], t[MX], L[2*MX], R[2*MX], G[MX][MX], DP[MX][2*MX][2*MX];

int main() {
	if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
	ios_base::sync_with_stdio(0), cin.tie(0);

	int N, K, Q; cin >> N >> K >> Q;
	for (int i = 0; i < N; ++i) {
		string s; cin >> s;
		for (int j = 0; j < N; ++j) G[i][j] = s[j] == '1';
	}
	for (int i = 0; i < Q; ++i)
		cin >> bs[i] >> s[i] >> bt[i] >> t[i], --bs[i], --s[i], --bt[i], --t[i];

	for (int i = 0; i < K; ++i) {
		for (int j = 0; j < N; ++j) {
			for (int k = 0; k < N+Q; ++k) L[k] = k == j;
			for (int k = 0; k < Q; ++k)
				if (i == bs[k] && j == s[k]) L[N+k] = 1;
			
			for (int k = 0; k < N+Q; ++k)
				for (int l = 0; l < N; ++l)
					if (i && G[l][j]) (L[k] += DP[i-1][k][l]) %= MOD;
			
			for (int k = 0; k < N+Q; ++k) R[k] = k == j;
			for (int k = 0; k < Q; ++k)
				if (i == bt[k] && j == t[k]) R[N+k] = 1;

			for (int k = 0; k < N+Q; ++k)
				for (int l = 0; l < N; ++l)
					if (i && G[j][l]) (R[k] += DP[i-1][l][k]) %= MOD;

			for (int k = 0; k < N+Q; ++k)
				for (int l = 0; l < N+Q; ++l)
					(DP[i][k][l] += L[k]*R[l]) %= MOD;
		}
		memcpy(DP[i+1], DP[i], sizeof DP[i]);
	}

	for (int i = 0; i < Q; ++i) cout << DP[K][N+i][N+i] << '\n';
}