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 + 5;
int size, seg[maxn << 2][32][2], a[maxn][32], b[5], idx[maxn], cal[32][2];
void build(int begin, int end, int index) {
  if (begin == end) {
    for (int i = 0; i ^ size; ++i)
      seg[index][i][0] = seg[index][i][1] = a[begin][i];
    idx[begin] = index;
    return;
  }
  int mid = begin + end >> 1;
  build(begin, mid, index << 1);
  build(mid + 1, end, index << 1 ^ 1);
  for (int i = 0; i ^ size; ++i) {
    seg[index][i][0] = min(seg[index << 1][i][0], seg[index << 1 ^ 1][i][0]);
    seg[index][i][1] = max(seg[index << 1][i][1], seg[index << 1 ^ 1][i][1]);
  }
}
void push_up(int pos) {
  int index = idx[pos];
  for (int i = 0; i ^ size; ++i)
    seg[index][i][0] = seg[index][i][1] = a[pos][i];
  while (index ^ 1) {
    index >>= 1;
    for (int i = 0; i ^ size; ++i) {
      seg[index][i][0] = min(seg[index << 1][i][0], seg[index << 1 ^ 1][i][0]);
      seg[index][i][1] = max(seg[index << 1][i][1], seg[index << 1 ^ 1][i][1]);
    }
  }
}
void push_down(int begin, int end, int index, int l, int r) {
  if (begin >= l && end <= r) {
    for (int i = 0; i ^ size; ++i) {
      cal[i][0] = min(cal[i][0], seg[index][i][0]);
      cal[i][1] = max(cal[i][1], seg[index][i][1]);
    }
    return;
  }
  int mid = begin + end >> 1;
  if (mid >= l) push_down(begin, mid, index << 1, l, r);
  if (mid < r) push_down(mid + 1, end, index << 1 ^ 1, l, r);
}
int main() {
  int n, k;
  cin >> n >> k;
  size = 1 << k;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j ^ k; ++j) cin >> b[j];
    for (int j = 0; j ^ 1 << k; ++j)
      for (int l = 0; l ^ k; ++l)
        j&(1 << l) ? a[i][j] += b[l] : a[i][j] -= b[l];
  }
  build(1, n, 1);
  int q;
  cin >> q;
  while (q--) {
    int op;
    cin >> op;
    if (op == 1) {
      int pos;
      cin >> pos;
      for (int i = 0; i ^ k; ++i) cin >> b[i];
      memset(a[pos], 0, size * sizeof(int));
      for (int i = 0; i ^ size; ++i)
        for (int j = 0; j ^ k; ++j)
          i&(1 << j) ? a[pos][i] += b[j] : a[pos][i] -= b[j];
      push_up(pos);
    } else {
      int l, r;
      cin >> l >> r;
      for (int i = 0; i ^ size; ++i)
        cal[i][0] = 0x3f3f3f3f, cal[i][1] = 0xc0c0c0c0c0;
      push_down(1, n, 1, l, r);
      int res = 0;
      for (int i = 0; i ^ size; ++i) res = max(res, cal[i][1] - cal[i][0]);
      cout << res << endl;
    }
  }
}
