#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e5;
int n, m;
struct note {
  int d, p, l;
} a[N + 5];
vector<int> p[N + 5];
struct node {
  long long cnt, sum;
  int ls, rs;
} seg[(N << 5) + 10];
int rt[N + 5];
void insert(int x, int k, int &p, int tl, int tr) {
  static int tot = 0;
  seg[++tot] = seg[p], seg[p = tot].cnt += k, seg[p].sum += (long long)x * k;
  if (tl == tr)
    return ;
  int mid = tl + tr >> 1;
  x <= mid ? insert(x, k, seg[p].ls, tl, mid) : insert(x, k, seg[p].rs, mid + 1, tr);
}
long long query(int p, int tl, int tr, long long L) {
  if (!p || tl == tr)
    return L * tl;
  int mid = tl + tr >> 1;
  return L <= seg[seg[p].ls].cnt ? query(seg[p].ls, tl, mid, L) : seg[seg[p].ls].sum + query(seg[p].rs, mid + 1,
         tr, L - seg[seg[p].ls].cnt);
}
inline int query(long long g, long long L) {
  int l = 1, r = N, mid, ret = -1;
  while (l <= r) {
    mid = l + r >> 1;
    L <= seg[rt[mid]].cnt &&query(rt[mid], 1, N, L) <= g ? (ret = mid, l = mid + 1) : r = mid - 1;
  }
  return ret;
}
int main() {
  scanf("%d%d", &n, &m);
  for (register int i = 1; i <= n; ++i)
    scanf("%d%d%d", &a[i].d, &a[i].p, &a[i].l), p[a[i].d].push_back(i);
  for (register int i = N; i && (rt[i] = rt[i + 1], 1); --i)
    for (register int j = 0; j < p[i].size(); ++j)
      insert(a[p[i][j]].p, a[p[i][j]].l, rt[i], 1, N);
  long long g, L;
  for (; m; --m)
    scanf("%lld%lld", &g, &L), printf("%d\n", query(g, L));
}