You are given an array a of n points in k-dimensional space. Let the distance between two points a_x and a_y be ∑ _{i = 1}^{k} |a_{x, i} - a_{y, i}| (it is also known as Manhattan distance).

You have to process q queries of the following two types:

  * 1 i b_1 b_2 ... b_k — set i-th element of a to the point (b_1, b_2, ..., b_k);
  * 2 l r — find the maximum distance between two points a_i and a_j, where l ≤ i, j ≤ r.

Input

The first line contains two numbers n and k (1 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ k ≤ 5) — the number of elements in a and the number of dimensions of the space, respectively.

Then n lines follow, each containing k integers a_{i, 1}, a_{i, 2}, ..., a_{i, k} (-10^6 ≤ a_{i, j} ≤ 10^6) — the coordinates of i-th point.

The next line contains one integer q (1 ≤ q ≤ 2 ⋅ 10^5) — the number of queries.

Then q lines follow, each denoting a query. There are two types of queries:

  * 1 i b_1 b_2 ... b_k (1 ≤ i ≤ n, -10^6 ≤ b_j ≤ 10^6) — set i-th element of a to the point (b_1, b_2, ..., b_k);
  * 2 l r (1 ≤ l ≤ r ≤ n) — find the maximum distance between two points a_i and a_j, where l ≤ i, j ≤ r.



There is at least one query of the second type.

Output

Print the answer for each query of the second type.

Example

Input


5 2
1 2
2 3
3 4
4 5
5 6
7
2 1 5
2 1 3
2 3 5
1 5 -1 -2
2 1 5
1 4 -1 -2
2 1 5


Output


8
4
4
12
10
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 15;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
int n, k, q;
int upper;
int a[maxn][5];
int mx[maxn * 3][32];
int cntret[32];
inline void push_up(int u) {
  for (int msk = 0; msk < upper; msk++) {
    mx[u][msk] = max(mx[(u << 1)][msk], mx[(u << 1 | 1)][msk]);
  }
}
void work(int u, int id) {
  memset(mx[u], 0, sizeof(mx[u]));
  for (int msk = 0; msk < upper; msk++) {
    for (int j = 0; j < k; j++) {
      if (msk >> j & 1)
        mx[u][msk] += a[id][j];
      else
        mx[u][msk] -= a[id][j];
    }
  }
}
void build(int u, int l, int r) {
  if (l == r) {
    work(u, l);
    return;
  }
  int mid = (l + r) >> 1;
  build((u << 1), l, mid);
  build((u << 1 | 1), mid + 1, r);
  push_up(u);
}
void upd(int u, int l, int r, int pos) {
  if (l == r) {
    work(u, l);
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    upd((u << 1), l, mid, pos);
  else
    upd((u << 1 | 1), mid + 1, r, pos);
  push_up(u);
}
void query(int u, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr) {
    for (int i = 0; i < upper; i++) cntret[i] = max(cntret[i], mx[u][i]);
    return;
  }
  int mid = (l + r) >> 1;
  if (ql <= mid) query((u << 1), l, mid, ql, qr);
  if (qr > mid) query((u << 1 | 1), mid + 1, r, ql, qr);
}
int main() {
  scanf("%d%d", &n, &k);
  upper = (1 << k);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < k; j++) {
      scanf("%d", &a[i][j]);
    }
  }
  build(1, 1, n);
  scanf("%d", &q);
  int op, l, r, id;
  while (q--) {
    scanf("%d", &op);
    if (op == 1) {
      scanf("%d", &id);
      for (int j = 0; j < k; j++) scanf("%d", &a[id][j]);
      upd(1, 1, n, id);
    } else {
      scanf("%d%d", &l, &r);
      for (int msk = 0; msk < upper; msk++) cntret[msk] = -inf;
      query(1, 1, n, l, r);
      int ans = 0;
      for (int msk = 0; msk < upper; msk++) {
        ans = max(ans, cntret[msk] + cntret[upper - 1 - msk]);
      }
      printf("%d\n", ans);
    }
  }
  return 0;
}
