#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;int n, m, t;
char s[100005][12];
struct martix {ll c[10][10];
}sum[400005];martix mul(martix x, martix y) {martix res;for(int i = 0; i < m; i++)for(int j = 0; j < m; j++) res.c[i][j] = 0;for(int i = 0; i < m; i++)for(int k = 0; k < m; k++)for(int j = 0; j < m; j++)res.c[i][j] = (res.c[i][j] + x.c[i][k] * y.c[k][j] % mod) % mod;return res;
}martix fun(char a[12]) {martix res;for(int i = 0; i < m; i++)for(int j = 0; j < m; j++) res.c[i][j] = 0;for(int i = 0; i < m; i++) {if(a[i] == '0') {int l = i, r = i;while(l - 1 >= 0 && a[l - 1] == '0') l--;while(r + 1 < m && a[r + 1] == '0') r++;for(int j = l; j <= r; j++) res.c[i][j] = 1;}}return res;
}void pushup(int rt) {sum[rt] = mul(sum[rt << 1], sum[rt << 1 | 1]);
}void build(int l, int r, int rt) {if(l == r) {sum[rt] = fun(s[l]);return;}int m = l + r >> 1;build(l, m, rt << 1);build(m + 1, r, rt << 1 | 1);pushup(rt);
}void update(int k, int l, int r, int rt) {if(l == r) {sum[rt] = fun(s[k]);return;}int m = l + r >> 1;if(k <= m) update(k, l, m, rt << 1);else update(k, m + 1, r, rt << 1 | 1);pushup(rt);
}int main() {scanf("%d%d%d", &n, &m, &t);for(int i = 1; i <= n; i++) {scanf("%s", s[i]);}build(1, n, 1);while(t--) {int opt, a, b;scanf("%d%d%d", &opt, &a, &b);if(opt == 1) {if(s[a][b - 1] == '0') s[a][b - 1] = '1';else s[a][b - 1] = '0';update(a, 1, n, 1);} else if(opt == 2) {printf("%lld\n", sum[1].c[a - 1][b - 1]);}}return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans;
int n;ll q[30][30];
ll sum[30];
int id[30];
void dfs(int now, int tot, ll val) {if(tot == n) {ans = max(ans, val);return;}if(now > n * 2) return;for(int i = now; i <= n * 2; i++) {ll tmp = val + sum[i];for(int j = 1; j <= tot; j++) tmp -= q[i][id[j]] * 2LL;tot++;id[tot] = i;dfs(i + 1, tot, tmp);tot--;}return;
}int main() {ans = 0;scanf("%d", &n);for(int i = 1; i <= n * 2; i++) {for(int j = 1; j <= n * 2; j++) {scanf("%lld", &q[i][j]);sum[i] += q[i][j];}}dfs(1, 0, 0);printf("%lld\n", ans);return 0;
}