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>
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
 public:
  int x;
  int y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
class Point {
 public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);
  }
};
struct Segment {
  Point p1, p2;
};
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
bool parareru(Point a, Point b, Point c, Point d) {
  return abs(cross(a - b, d - c)) < (1e-10);
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < (1e-10)) return (c - a).absv();
  if (dot(a - b, c - b) < (1e-10)) return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < (1e-10)) return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < (1e-10)) return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < (1e-10)) return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < (1e-10)) return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            (1e-10)) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            (1e-10));
}
double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b)) return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);
  return a.p1 + (a.p2 - a.p1) * t;
}
string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}
int gcd(int v, int b) {
  if (v > b) return gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return gcd(v, b % v);
}
double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pair<int, int> operator+(const pair<int, int> &l, const pair<int, int> &r) {
  return {l.first + r.first, l.second + r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa, int rr, int warukazu) {
  if (rr == 0) return 1 % warukazu;
  if (rr == 1) return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((long long)beki(wa, rr - 1, warukazu) * (long long)wa) % warukazu;
  long long zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
double bekid(double w, int r) {
  if (r == 0) return 1.0;
  if (r == 1) return w;
  if (r % 2) return bekid(w, r - 1) * w;
  double f = bekid(w, r / 2);
  return f * f;
}
int comb(int nn, int rr) {
  int r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}
void gya(int ert) {
  pr[0] = 1;
  for (int i = 1; i <= ert; i++) {
    pr[i] = (pr[i - 1] * i) % mod;
  }
  for (int i = 0; i <= ert; i++) inv[i] = beki(pr[i], mod - 2, mod);
}
struct Segmin {
 private:
 public:
  int cor = (1 << 18);
  vector<int> vec;
  void shoki1() { vec.resize(2 * cor + 3, (1ll << 31) - 1); }
  void shoki2() {
    for (int i = cor - 1; i > 0; i--) {
      if (vec[2 * i] <= vec[2 * i + 1])
        vec[i] = vec[2 * i];
      else
        vec[i] = vec[2 * i + 1];
    }
  }
  void updchan(int x, int w) {
    x += cor;
    vec[x] = w;
    while (1) {
      x /= 2;
      if (x == 0) break;
      if (vec[2 * x] <= vec[2 * x + 1])
        vec[x] = vec[2 * x];
      else
        vec[x] = vec[2 * x + 1];
    }
  }
  int segmin(int a, int b, int k = 1, int l = 0, int r = -10) {
    if (r < 0) r = cor;
    if (a <= l && r <= b) {
      return vec[k];
    }
    if (r <= a || b <= l) {
      return ((1ll << 31) - 1);
    }
    int v1 = segmin(a, b, k * 2, l, (l + r) / 2),
        v2 = segmin(a, b, k * 2 + 1, (l + r) / 2, r);
    if (v1 <= v2)
      return v1;
    else
      return v2;
  }
};
struct Segmax {
 private:
 public:
  int cor = (1 << 18);
  vector<int> vec;
  void shoki1() { vec.resize(2 * cor + 3, (-(1ll << 30))); }
  void shoki2() {
    for (int i = cor - 1; i > 0; i--) {
      vec[i] = max(vec[2 * i], vec[2 * i + 1]);
    }
  }
  void updchan(int x, int w) {
    x += cor;
    vec[x] = w;
    while (1) {
      x /= 2;
      if (x == 0) break;
      if (vec[2 * x] > vec[2 * x + 1])
        vec[x] = vec[2 * x];
      else
        vec[x] = vec[2 * x + 1];
    }
  }
  int segmax(int a, int b, int k = 1, int l = 0, int r = -10) {
    if (r < 0) r = cor;
    if (a <= l && r <= b) {
      return vec[k];
    }
    if (r <= a || b <= l) {
      return (-(1ll << 30));
    }
    int v1 = segmax(a, b, k * 2, l, (l + r) / 2),
        v2 = segmax(a, b, k * 2 + 1, (l + r) / 2, r);
    return max(v1, v2);
  }
};
Segmin smin[16];
Segmax smax[16];
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < (1 << (k - 1)); i++) {
    smin[i].shoki1();
    smax[i].shoki1();
  }
  for (int i = 1; i <= n; i++) {
    vector<int> we(k);
    for (int j = 0; j < k; j++) cin >> we[j];
    for (int j = 0; j < (1 << (k - 1)); j++) {
      int wa = 0;
      for (int t = 0; t < k; t++) {
        if (j & (1 << t))
          wa += we[t];
        else
          wa -= we[t];
      }
      smin[j].vec[smin[j].cor + i] = wa;
      smax[j].vec[smax[j].cor + i] = wa;
    }
  }
  for (int i = 0; i < (1 << (k - 1)); i++) {
    smin[i].shoki2();
    smax[i].shoki2();
  }
  int q;
  cin >> q;
  for (int er = 0; er < q; er++) {
    int t;
    cin >> t;
    if (t == 2) {
      int ans = -1;
      int l, r;
      cin >> l >> r;
      r++;
      for (int jj = 0; jj < (1 << (k - 1)); jj++) {
        ans = max(ans, smax[jj].segmax(l, r) - smin[jj].segmin(l, r));
      }
      cout << ans << "\n";
    } else {
      vector<int> we(k);
      int id;
      cin >> id;
      for (int j = 0; j < k; j++) cin >> we[j];
      for (int j = 0; j < (1 << (k - 1)); j++) {
        int wa = 0;
        for (int t = 0; t < k; t++) {
          if (j & (1 << t))
            wa += we[t];
          else
            wa -= we[t];
        }
        smin[j].updchan(id, wa);
        smax[j].updchan(id, wa);
      }
    }
  }
  return 0;
}
