#include <bits/stdc++.h>
using namespace std;
int tr[200005 << 2][32];
int a[200005][5];
int n, k;
void pushup(int rt) {
  for (int i = 0; i < (1 << k); i++) {
    tr[rt][i] = min(tr[rt << 1][i], tr[rt << 1 | 1][i]);
  }
}
void build(int l, int r, int rt) {
  if (l == r) {
    for (int i = 0; i < (1 << k); i++) {
      int tmp = 0;
      for (int j = 0; j < k; j++) {
        if ((i >> j) & 1) {
          tmp += a[l][j];
        } else {
          tmp -= a[l][j];
        }
      }
      tr[rt][i] = tmp;
    }
    return;
  }
  int m = (l + r) >> 1;
  build(l, m, rt << 1);
  build(m + 1, r, rt << 1 | 1);
  pushup(rt);
}
void update(int l, int r, int rt, int x) {
  if (l == r) {
    for (int i = 0; i < (1 << k); i++) {
      int tmp = 0;
      for (int j = 0; j < k; j++) {
        if ((i >> j) & 1) {
          tmp += a[l][j];
        } else {
          tmp -= a[l][j];
        }
      }
      tr[rt][i] = tmp;
    }
    return;
  }
  int m = (l + r) >> 1;
  if (x <= m)
    update(l, m, rt << 1, x);
  else
    update(m + 1, r, rt << 1 | 1, x);
  pushup(rt);
}
int query(int l, int r, int rt, int L, int R, int f) {
  if (L <= l && R >= r) {
    return tr[rt][f];
  }
  int m = (l + r) >> 1;
  int ans = 1e9;
  if (L <= m) ans = min(ans, query(l, m, rt << 1, L, R, f));
  if (R > m) ans = min(ans, query(m + 1, r, rt << 1 | 1, L, R, f));
  return ans;
}
void work() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < k; j++) {
      scanf("%d", &a[i][j]);
    }
  }
  build(1, n, 1);
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int x;
      scanf("%d", &x);
      for (int i = 0; i < k; i++) {
        scanf("%d", &a[x][i]);
      }
      update(1, n, 1, x);
    } else {
      int l, r;
      scanf("%d%d", &l, &r);
      int ans = 0;
      for (int i = 0; i < (1 << k); i++) {
        int x = query(1, n, 1, l, r, i);
        int y = query(1, n, 1, l, r, ((1 << k) - 1) ^ i);
        ans = max(ans, abs(x + y));
      }
      printf("%d\n", ans);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) {
    work();
  }
}
