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 + 7;
long long sum[maxn << 2][32], qr[32];
int k, a[maxn][6], n, mask, b[10];
void Build(int l, int r, int rt) {
  if (l == r) {
    for (int i = 0; i < mask; ++i) {
      for (int j = 0; j < k; ++j) {
        if ((1 << j) & i) {
          sum[rt][i] += a[l][j + 1];
        } else
          sum[rt][i] -= a[l][j + 1];
      }
    }
    return;
  }
  int m = (l + r) >> 1;
  Build(l, m, rt << 1);
  Build(m + 1, r, rt << 1 | 1);
  for (int i = 0; i < mask; ++i) {
    sum[rt][i] = max(sum[rt << 1 | 1][i], sum[rt << 1][i]);
  }
}
void Update(int L, int l, int r, int rt) {
  if (l == r) {
    for (int i = 0; i < mask; ++i) {
      sum[rt][i] = 0;
      for (int j = 0; j < k; ++j) {
        if ((1 << j) & i) {
          sum[rt][i] += b[j + 1];
        } else
          sum[rt][i] -= b[j + 1];
      }
    }
    return;
  }
  int m = (l + r) >> 1;
  if (L <= m)
    Update(L, l, m, rt << 1);
  else
    Update(L, m + 1, r, rt << 1 | 1);
  for (int i = 0; i < mask; ++i) {
    sum[rt][i] = max(sum[rt << 1 | 1][i], sum[rt << 1][i]);
  }
}
void Query(int L, int R, int l, int r, int rt) {
  if (L <= l && r <= R) {
    for (int i = 0; i < mask; ++i) {
      qr[i] = max(qr[i], sum[rt][i]);
    }
    return;
  }
  int m = (l + r) >> 1;
  if (L <= m) {
    Query(L, R, l, m, rt << 1);
  }
  if (R > m) {
    Query(L, R, m + 1, r, rt << 1 | 1);
  }
}
void init() {
  for (int i = 0; i < 32; ++i) {
    qr[i] = -1e9 + 7;
  }
}
int main() {
  int n;
  scanf("%d%d", &n, &k);
  mask = 1 << k;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= k; ++j) {
      scanf("%d", &a[i][j]);
    }
  }
  Build(1, n, 1);
  int q, op, pos;
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &op);
    if (op == 1) {
      scanf("%d", &pos);
      for (int i = 1; i <= k; ++i) {
        scanf("%d", &b[i]);
      }
      Update(pos, 1, n, 1);
    } else {
      int l, r;
      scanf("%d%d", &l, &r);
      init();
      Query(l, r, 1, n, 1);
      long long ans = 0;
      for (int i = 0; i < mask; ++i) {
        ans = max(ans, qr[i] + qr[i ^ (mask - 1)]);
      }
      printf("%I64d\n", ans);
    }
  }
  return 0;
}
