#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 2e5 + 1;
const long long mod = 1e9 + 7;
int arr[32][N], tree[32][4 * N];
void build(int ss, int se, int si, int k) {
  if (ss == se) {
    for (int mask = 0; mask < (1 << k); mask++) {
      tree[mask][si] = arr[mask][ss];
    }
  } else {
    int mid = (ss + se) / 2;
    build(ss, mid, 2 * si + 1, k);
    build(mid + 1, se, 2 * si + 2, k);
    for (int mask = 0; mask < (1 << k); mask++) {
      tree[mask][si] = max(tree[mask][2 * si + 1], tree[mask][2 * si + 2]);
    }
  }
}
void update(int qi, int ss, int se, int si, int k) {
  if (qi < ss || qi > se) return;
  if (ss == se) {
    for (int mask = 0; mask < (1 << k); mask++) {
      tree[mask][si] = arr[mask][ss];
    }
  } else {
    int mid = (ss + se) / 2;
    update(qi, ss, mid, 2 * si + 1, k);
    update(qi, mid + 1, se, 2 * si + 2, k);
    for (int mask = 0; mask < (1 << k); mask++) {
      tree[mask][si] = max(tree[mask][2 * si + 1], tree[mask][2 * si + 2]);
    }
  }
}
int query(int qs, int qe, int ss, int se, int si, int mask) {
  if (qs > se || qe < ss) {
    return -inf;
  }
  if (qs <= ss && se <= qe) {
    return tree[mask][si];
  }
  int mid = (ss + se) / 2;
  return max(query(qs, qe, ss, mid, 2 * si + 1, mask),
             query(qs, qe, mid + 1, se, 2 * si + 2, mask));
}
void solve() {
  int n, k;
  cin >> n >> k;
  auto setval = [&](int i) {
    vector<int> temp(k);
    for (int j = 0; j < k; j++) {
      cin >> temp[j];
    }
    for (int mask = 0; mask < (1 << k); mask++) {
      int val = 0;
      for (int j = 0; j < k; j++) {
        if ((mask & (1 << j)) == (1 << j)) {
          val += temp[j];
        } else {
          val -= temp[j];
        }
      }
      arr[mask][i] = val;
    }
  };
  for (int i = 0; i < n; i++) {
    setval(i);
  }
  build(0, n - 1, 0, k);
  int q, t, pos, l, r;
  cin >> q;
  while (q--) {
    cin >> t;
    if (t == 1) {
      cin >> pos;
      pos--;
      setval(pos);
      update(pos, 0, n - 1, 0, k);
    } else {
      cin >> l >> r;
      l--;
      r--;
      int ans = 0;
      vector<int> asked(1 << k);
      for (int mask = 0; mask < (1 << k); mask++) {
        if (asked[mask]) continue;
        int nmask = ((1 << k) - 1) ^ mask;
        ans = max(ans, query(l, r, 0, n - 1, 0, mask) +
                           query(l, r, 0, n - 1, 0, nmask));
        asked[mask] = asked[nmask] = 1;
      }
      cout << ans << "\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  std::cout << std::fixed << std::setprecision(20);
  ;
  int t = 1;
  while (t--) {
    solve();
  }
}
