#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int N = 800005;
int tr[33][N];
void update(int* tr, int rt, int l, int r, int ql, int qr, int val) {
  if (l >= ql && r <= qr) {
    tr[rt] = val;
    return;
  }
  int mid = l + r >> 1;
  if (ql <= mid) update(tr, (rt << 1), l, mid, ql, qr, val);
  if (qr > mid) update(tr, ((rt << 1) | 1), mid + 1, r, ql, qr, val);
  tr[rt] = max(tr[(rt << 1)], tr[((rt << 1) | 1)]);
}
int query(int* tr, int rt, int l, int r, int ql, int qr) {
  if (l >= ql && r <= qr) {
    return tr[rt];
  }
  int mid = l + r >> 1, ans = -1e9;
  if (ql <= mid) ans = query(tr, (rt << 1), l, mid, ql, qr);
  if (qr > mid) ans = max(ans, query(tr, ((rt << 1) | 1), mid + 1, r, ql, qr));
  return ans;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int en = (1 << k) - 1;
  for (int i = 0; i <= en; i++) {
    for (int j = 0; j < N; j++) {
      tr[i][j] = -1e9;
    }
  }
  for (int i = 1; i <= n; i++) {
    int a[6];
    for (int j = 1; j <= k; j++) {
      scanf("%d", &a[j]);
    }
    int enn = en / 2;
    for (int j = 0; j <= enn; j++) {
      int val = 0;
      int oppo = 0;
      for (int bit = 1, ct = 1; ct <= k; bit <<= 1, ct++) {
        if (j & bit)
          val += a[ct];
        else
          val -= a[ct], oppo |= bit;
      }
      update(tr[j], 1, 1, n, i, i, val);
      update(tr[oppo], 1, 1, n, i, i, -val);
    }
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int id, a[6];
      scanf("%d", &id);
      for (int i = 1; i <= k; i++) scanf("%d", a + i);
      int enn = en;
      for (int j = 0; j <= enn; j++) {
        int oppo = 0;
        int val = 0;
        for (int bit = 1, ct = 1; ct <= k; bit <<= 1, ct++) {
          if (j & bit)
            val += a[ct];
          else
            val -= a[ct], oppo |= bit;
        }
        update(tr[j], 1, 1, n, id, id, val);
        update(tr[oppo], 1, 1, n, id, id, -val);
      }
    } else {
      int l, r;
      scanf("%d%d", &l, &r);
      int ans = -1e9;
      int enn = en / 2;
      for (int j = 0; j <= enn; j++) {
        int oppo = 0;
        for (int bit = 1, ct = 1; ct <= k; bit <<= 1, ct++) {
          if (!(j & bit)) oppo |= bit;
        }
        ans = max(ans,
                  query(tr[j], 1, 1, n, l, r) + query(tr[oppo], 1, 1, n, l, r));
      }
      printf("%d\n", ans);
    }
  }
}
