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 N = 2e5 + 5, K = 5, MASK = 32, INF = 1e9;
int n, k, q, a[N][5];
pair<int, int> st[MASK][4 * N];
pair<int, int> merge(pair<int, int> lt, pair<int, int> rt) {
  pair<int, int> res = {-1, -1};
  res.first = min(lt.first, rt.first);
  res.second = max(lt.second, rt.second);
  return res;
}
int fmap(int mask, int v[]) {
  int res = 0;
  for (int i = 0; i < k; i++) {
    if (mask & (1 << i)) {
      res += v[i];
    } else {
      res -= v[i];
    }
  }
  return res;
}
void build(int mask, int i, int L, int R) {
  if (L == R) {
    int v = fmap(mask, a[L]);
    st[mask][i] = {v, v};
  } else {
    build(mask, i << 1, L, (L + R) / 2);
    build(mask, i << 1 | 1, (L + R) / 2 + 1, R);
    st[mask][i] = merge(st[mask][i << 1], st[mask][i << 1 | 1]);
  }
}
pair<int, int> query(int mask, int i, int L, int R, int qL, int qR) {
  if (qL > R || qR < L) return {INF, -INF};
  if (qL <= L && qR >= R) return st[mask][i];
  pair<int, int> lt = query(mask, i << 1, L, (L + R) / 2, qL, qR),
                 rt = query(mask, i << 1 | 1, (L + R) / 2 + 1, R, qL, qR);
  return merge(lt, rt);
}
void update(int mask, int i, int L, int R, int k) {
  if (k < L || k > R) return;
  if (L == R) {
    int v = fmap(mask, a[L]);
    st[mask][i] = {v, v};
  } else {
    update(mask, i << 1, L, (L + R) / 2, k);
    update(mask, i << 1 | 1, (L + R) / 2 + 1, R, k);
    st[mask][i] = merge(st[mask][i << 1], st[mask][i << 1 | 1]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < k; j++) cin >> a[i][j];
  for (int mask = 0; mask < MASK; mask++) build(mask, 1, 0, n - 1);
  cin >> q;
  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      int i;
      cin >> i;
      for (int j = 0; j < k; j++) cin >> a[i - 1][j];
      for (int mask = 0; mask < MASK; mask++) update(mask, 1, 0, n - 1, i - 1);
    } else {
      int l, r, res = 0;
      cin >> l >> r;
      for (int mask = 0; mask < MASK; mask++) {
        pair<int, int> q = query(mask, 1, 0, n - 1, l - 1, r - 1);
        res = max(res, q.second - q.first);
      }
      cout << res << "\n";
    }
  }
}
