#include <bits/stdc++.h>
using namespace std;
struct pony {
  long long s, m, r, t;
} ponys[100005];
bool cmp(pony &x, pony &y) { return x.t < y.t; }
struct node {
  long long l, r, latest;
  long long *sm, *sr, *t;
} nodes[100005 << 3];
void build(long long ord, long long l, long long r) {
  nodes[ord].latest = 0;
  nodes[ord].l = l, nodes[ord].r = r;
  if (l == r) {
    nodes[ord].sm = &ponys[l].m;
    nodes[ord].sr = &ponys[l].r;
    nodes[ord].t = &ponys[l].t;
    return;
  }
  int m = (l + r) >> 1;
  build(ord << 1, l, m);
  build(ord << 1 | 1, m + 1, r);
  pony *tmp = new pony[r - l + 1];
  for (int i = 0; i < r - l + 1; i++) tmp[i] = ponys[l + i];
  sort(tmp, tmp + r - l + 1, cmp);
  nodes[ord].sm = new long long[r - l + 2];
  nodes[ord].sr = new long long[r - l + 2];
  nodes[ord].t = new long long[r - l + 2];
  nodes[ord].sm[0] = nodes[ord].sr[0] = nodes[ord].t[0] = 0;
  for (int i = 1; i < r - l + 2; i++) {
    nodes[ord].sm[i] = tmp[i - 1].m + nodes[ord].sm[i - 1];
    nodes[ord].sr[i] = tmp[i - 1].r + nodes[ord].sr[i - 1];
    nodes[ord].t[i] = tmp[i - 1].t;
  }
  delete[] tmp;
}
long long mana_obserbed(long long ord, long long t, long long l, long long r) {
  long long res = 0;
  if (nodes[ord].latest > 0)
    nodes[ord << 1].latest = nodes[ord << 1 | 1].latest = nodes[ord].latest;
  if (nodes[ord].l == l && nodes[ord].r == r) {
    if (nodes[ord].latest > 0) {
      if (l == r)
        res = min(ponys[l].m, ponys[l].r * (t - nodes[ord].latest));
      else {
        int len = nodes[ord].r - nodes[ord].l + 2;
        int tmp = upper_bound(nodes[ord].t + 1, nodes[ord].t + len,
                              t - nodes[ord].latest) -
                  nodes[ord].t;
        res = nodes[ord].sm[tmp - 1] +
              (nodes[ord].sr[len - 1] - nodes[ord].sr[tmp - 1]) *
                  (t - nodes[ord].latest);
      }
      nodes[ord].latest = t;
      return res;
    } else if (nodes[ord].latest == 0 && l == r) {
      res = min(ponys[l].m, ponys[l].s + ponys[l].r * t);
      nodes[ord].latest = t;
      return res;
    }
  }
  int m = (nodes[ord].l + nodes[ord].r) >> 1;
  if (r <= m)
    res += mana_obserbed(ord << 1, t, l, r);
  else if (m < l)
    res += mana_obserbed(ord << 1 | 1, t, l, r);
  else
    res += mana_obserbed(ord << 1, t, l, m) +
           mana_obserbed(ord << 1 | 1, t, m + 1, r);
  nodes[ord].latest = nodes[ord << 1].latest == nodes[ord << 1 | 1].latest
                          ? nodes[ord << 1].latest
                          : -1;
  return res;
}
int main() {
  long long n, m, t, l, r;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> ponys[i].s >> ponys[i].m >> ponys[i].r;
    if (ponys[i].r)
      ponys[i].t = (ponys[i].m + ponys[i].r - 1) / ponys[i].r;
    else
      ponys[i].t = 0x7fffffffffffffff;
  }
  build(1, 1, n);
  cin >> m;
  for (long long i = 1; i <= m; i++) {
    cin >> t >> l >> r;
    cout << mana_obserbed(1, t, l, r) << endl;
  }
  return 0;
}
