#include <bits/stdc++.h>
using namespace std;
int a[200005][40];
int n, k;
int Minn[200005 * 4][40], Maxn[200005 * 4][40];
int Minnn, Maxnn, ans;
void modify(int t, int l, int r, int pos, int s) {
  if (l == r) {
    int sum = 0;
    for (int i = 0; i < k; i++) {
      if ((1 << i) & s)
        sum += a[l][i];
      else
        sum -= a[l][i];
    }
    Minn[t][s] = Maxn[t][s] = sum;
    return;
  }
  int mid = (l + r) / 2;
  if (pos <= mid) {
    modify(t * 2, l, mid, pos, s);
  } else {
    modify(t * 2 + 1, mid + 1, r, pos, s);
  }
  Maxn[t][s] = max(Maxn[t * 2][s], Maxn[t * 2 + 1][s]);
}
void dfs(int t, int s, int pos) {
  if (t == k) {
    modify(1, 1, n, pos, s);
  } else {
    dfs(t + 1, s, pos);
    dfs(t + 1, s + (1 << t), pos);
  }
}
void query(int t, int l, int r, int L, int R, int s1, int s2) {
  if (L <= l && r <= R) {
    Minnn = max(Minnn, Maxn[t][s2]);
    Maxnn = max(Maxnn, Maxn[t][s1]);
    return;
  }
  int mid = (l + r) / 2;
  if (L <= mid) query(t * 2, l, mid, L, R, s1, s2);
  if (mid < R) query(t * 2 + 1, mid + 1, r, L, R, s1, s2);
}
void build(int t, int l, int r) {
  for (int j = 0; j < (1 << k); j++) {
    Maxn[t][j] = -10000000;
  }
  if (l <= r) {
    return;
  }
  int mid = (l + r) / 2;
  build(t * 2, l, mid);
  build(t * 2 + 1, mid + 1, r);
}
int main() {
  scanf("%d%d", &n, &k);
  build(1, 1, n);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < k; j++) scanf("%d", &a[i][j]);
    dfs(0, 0, i);
  }
  int T;
  scanf("%d", &T);
  while (T--) {
    int Ca;
    scanf("%d", &Ca);
    if (Ca == 1) {
      int pos;
      scanf("%d", &pos);
      for (int i = 0; i < k; i++) scanf("%d", &a[pos][i]);
      dfs(0, 0, pos);
    } else {
      int l, r;
      scanf("%d%d", &l, &r);
      ans = -10000000;
      for (int i = 0; i < (1 << k); i++) {
        Minnn = -10000000;
        Maxnn = -10000000;
        query(1, 1, n, l, r, i, (((1 << k) - 1) ^ i));
        ans = max(ans, Minnn + Maxnn);
      }
      printf("%d\n", ans);
    }
  }
}
