Problem: Lord Tirek is a centaur and the main antagonist in the season four finale episodes in the series "My Little Pony: Friendship Is Magic". In "Twilight's Kingdom" (Part 1), Tirek escapes from Tartarus and drains magic from ponies to grow stronger.

<image>

The core skill of Tirek is called Absorb Mana. It takes all mana from a magic creature and gives them to the caster.

Now to simplify the problem, assume you have n ponies (numbered from 1 to n). Each pony has three attributes:

  * si : amount of mana that the pony has at time 0; 
  * mi : maximum mana that the pony can have; 
  * ri : mana regeneration per unit time. 



Lord Tirek will do m instructions, each of them can be described with three integers: ti, li, ri. The instruction means that at time ti, Tirek will use Absorb Mana on ponies with numbers from li to ri (both borders inclusive). We'll give you all the m instructions in order, count how much mana Tirek absorbs for each instruction.

Input

The first line contains an integer n (1 ≤ n ≤ 105) — the number of ponies. Each of the next n lines contains three integers si, mi, ri (0 ≤ si ≤ mi ≤ 105; 0 ≤ ri ≤ 105), describing a pony. 

The next line contains an integer m (1 ≤ m ≤ 105) — the number of instructions. Each of the next m lines contains three integers ti, li, ri (0 ≤ ti ≤ 109; 1 ≤ li ≤ ri ≤ n), describing an instruction of Lord Tirek. The instructions are given in strictly increasing order of ti (all ti are distinct).

Output

For each instruction, output a single line which contains a single integer, the total mana absorbed in this instruction.

Examples

Input

5
0 10 1
0 12 1
0 20 1
0 12 1
0 10 1
2
5 1 5
19 1 5


Output

25
58

Note

Every pony starts with zero mana. For the first instruction, each pony has 5 mana, so you get 25 mana in total and each pony has 0 mana after the first instruction.

For the second instruction, pony 3 has 14 mana and other ponies have mana equal to their mi.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5, inf = 0x7fffffff;
struct Pony {
  int re, mx, t, s;
} pony[25][maxn];
long long prefs[25][maxn], vfs[25][maxn];
int n, m, l, r, Time;
bool cmp(const Pony &a, const Pony &b) { return a.t < b.t; }
namespace SGT {
int last[maxn << 2];
void push_up(int rt) {
  if (last[rt << 1] == last[rt << 1 | 1])
    last[rt] = last[rt << 1];
  else
    last[rt] = -1;
}
void push_down(int rt) {
  if (last[rt] >= 0) last[rt << 1] = last[rt << 1 | 1] = last[rt];
}
void build(int l, int r, int rt, int step) {
  last[rt] = -2;
  if (l == r) {
    vfs[step][l] = vfs[step][l - 1] + pony[step][l].re;
    prefs[step][l] = prefs[step][l - 1] + pony[step][l].mx;
    return;
  }
  int mid = l + r >> 1;
  for (register int i = l; i <= r; ++i) pony[step + 1][i] = pony[step][i];
  sort(pony[step] + l, pony[step] + r + 1, cmp);
  for (register int i = l; i <= r; ++i) {
    prefs[step][i] = prefs[step][i - 1] + pony[step][i].mx;
    vfs[step][i] = vfs[step][i - 1] + pony[step][i].re;
  }
  build(l, mid, rt << 1, step + 1);
  build(mid + 1, r, rt << 1 | 1, step + 1);
}
long long query(int l, int r, int tl, int tr, int rt, int step) {
  if (tl == l && tr == r && ~last[rt]) {
    long long ret = 0;
    if (last[rt] == -2) {
      for (register int i = l; i <= r; ++i)
        ret += min(pony[step][i].s + 1LL * Time * pony[step][i].re,
                   1LL * pony[step][i].mx);
    } else {
      int p = l--, b = ++r;
      while (l < r - 1) {
        int mid = l + r >> 1;
        if (pony[step][mid].t < Time - last[rt])
          l = mid;
        else
          r = mid;
      }
      ret = prefs[step][l] - prefs[step][p - 1] +
            (vfs[step][b - 1] - vfs[step][l]) * (Time - last[rt]);
    }
    return (last[rt] = Time), ret;
  }
  push_down(rt);
  long long mid = tl + tr >> 1, ret = 0;
  if (r <= mid)
    ret = query(l, r, tl, mid, rt << 1, step + 1);
  else if (l > mid)
    ret = query(l, r, mid + 1, tr, rt << 1 | 1, step + 1);
  else
    ret = query(l, mid, tl, mid, rt << 1, step + 1) +
          query(mid + 1, r, mid + 1, tr, rt << 1 | 1, step + 1);
  return push_up(rt), ret;
}
}  // namespace SGT
int main() {
  scanf("%d", &n);
  for (register int i = 1; i <= n; ++i) {
    scanf("%d%d%d", &pony[0][i].s, &pony[0][i].mx, &pony[0][i].re);
    pony[0][i].t = pony[0][i].re ? (pony[0][i].mx * 1.0 / pony[0][i].re) : inf;
  }
  SGT::build(1, n, 1, 0);
  scanf("%d", &m);
  for (register int i = 1; i <= m; ++i) {
    scanf("%d%d%d", &Time, &l, &r);
    printf("%I64d\n", SGT::query(l, r, 1, n, 1, 0));
  }
  return 0;
}