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;
int t[200010 << 2][32], v[5], V[32], n, k, q, U;
const int INF = 0x3f3f3f3f;
void init_V() {
  memset(V, 0, sizeof(V));
  for (int s = 0; s < 1 << k; s++) {
    for (int i = 0; i < k; i++) {
      if (s & (1 << i))
        V[s] += v[i];
      else
        V[s] -= v[i];
    }
  }
}
void pushup(int x) {
  for (int s = 0; s < 1 << k; s++)
    t[x][s] = max(t[x << 1][s], t[x << 1 | 1][s]);
}
void insert(int x, int l, int r, int pos) {
  if (l == r) return memcpy(t[x], V, sizeof(V)), void();
  int mid = l + r >> 1;
  if (pos <= mid)
    insert(x << 1, l, mid, pos);
  else
    insert(x << 1 | 1, mid + 1, r, pos);
  pushup(x);
}
int query(int x, int ql, int qr, int l, int r, int s) {
  if (ql <= l && r <= qr) return t[x][s];
  int mid = l + r >> 1, ret = -INF;
  if (ql <= mid) ret = max(ret, query(x << 1, ql, qr, l, mid, s));
  if (qr >= mid + 1) ret = max(ret, query(x << 1 | 1, ql, qr, mid + 1, r, s));
  return ret;
}
int query(int l, int r) {
  int ret = -INF;
  for (int s = 0; s < 1 << k - 1; s++)
    ret = max(ret, query(1, l, r, 1, n, s) + query(1, l, r, 1, n, U ^ s));
  return ret;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k, U = (1 << k) - 1;
  memset(t, 0xcf, sizeof(t));
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < k; j++) cin >> v[j];
    init_V(), insert(1, 1, n, i);
  }
  cin >> q;
  for (int i = 1, op, l, r, pos; i <= q; i++) {
    cin >> op;
    if (op == 1) {
      cin >> pos;
      for (int j = 0; j < k; j++) cin >> v[j];
      init_V(), insert(1, 1, n, pos);
    }
    if (op == 2) {
      cin >> l >> r;
      cout << query(l, r) << endl;
    }
  }
  return 0;
}
