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;
template <class T>
inline int sz(const T& v) {
  return v.size();
}
const int N = 100000;
const int BLOCK = 250;
const int INF = 1000000000;
int s[N], m[N], r[N];
int lastCollects[N];
struct Block {
  int fromIndex;
  int toIndex;
  int lastCollect;
  bool canTakeAll;
  vector<pair<int, int>> times;
  vector<pair<long long, long long>> mana;
  inline void build() {
    lastCollect = -1;
    canTakeAll = false;
    times.reserve(toIndex - fromIndex);
    long long sumR = 0;
    long long sumM = 0;
    for (int i = (fromIndex); i < (toIndex); ++i) {
      int t = r[i] != 0 ? (m[i] + r[i] - 1) / r[i] : INF;
      times.emplace_back(t, i);
      sumR += r[i];
    }
    sort(times.begin(), times.end());
    mana.reserve(sz(times) + 1);
    mana.emplace_back(sumM, sumR);
    for (auto p : times) {
      sumM += m[p.second];
      sumR -= r[p.second];
      mana.emplace_back(sumM, sumR);
    }
  }
  inline long long getAll(int t) {
    long long ans = 0;
    if (!canTakeAll) {
      ans += getSegment(t, fromIndex, toIndex, true);
    } else {
      int index = lower_bound(times.begin(), times.end(),
                              make_pair(t - lastCollect, INF)) -
                  times.begin();
      ans += mana[index].first + 1LL * mana[index].second * (t - lastCollect);
    }
    canTakeAll = true;
    lastCollect = t;
    return ans;
  }
  inline long long getSegment(int t, int ql, int qr, bool force = false) {
    if (!force && ql <= fromIndex && toIndex <= qr) {
      return getAll(t);
    }
    if (toIndex <= ql || qr <= fromIndex) {
      return 0;
    }
    long long ans = 0;
    for (int i = max(ql, fromIndex); i < min(qr, toIndex); ++i) {
      lastCollects[i] = max(lastCollects[i], lastCollect);
      if (lastCollects[i] == -1) {
        ans += min((long long)m[i], s[i] + 1LL * r[i] * t);
      } else {
        ans += min((long long)m[i], 1LL * r[i] * (t - lastCollects[i]));
      }
      lastCollects[i] = t;
    }
    canTakeAll = false;
    return ans;
  }
};
int main() {
  std::ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < (n); ++i) {
    cin >> s[i] >> m[i] >> r[i];
    lastCollects[i] = -1;
  }
  int nBlocks = (n + BLOCK - 1) / BLOCK;
  vector<Block> blocks(nBlocks);
  for (int i = 0; i < nBlocks; ++i) {
    blocks[i].fromIndex = i * BLOCK;
    blocks[i].toIndex = min((i + 1) * BLOCK, n);
    blocks[i].build();
  }
  int m;
  cin >> m;
  for (int i = 0; i < (m); ++i) {
    int t, l, r;
    cin >> t >> l >> r;
    long long ans = 0;
    --l;
    for (Block& b : blocks) {
      ans += b.getSegment(t, l, r);
    }
    cout << ans << '\n';
  }
  cout.flush();
  return 0;
}