#include<bits/stdc++.h>

using namespace std;

#define N 100010

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;

struct info

{

        int d , p , l;

} a[N];

int n , m , len;

int b[N] , rt[N];

struct Presitent_Segment_Tree

{

        int sz;

        Presitent_Segment_Tree()

        {

                sz = ;

        }

        struct node

        {

                int lc , rc;

                ll cnt , sum;

        }    a[N * ];

        inline void build(int &now , int l , int r)

        {

                now = ++sz;

                if (l == r) return;

                int mid = (l + r) >> ;

                build(a[now].lc , l , mid);

                build(a[now].rc , mid +  , r);

        }

        inline void modify(int &now , int old , int l , int r , int x , int y)

        {

                now = ++sz;

                a[now].lc = a[old].lc , a[now].rc = a[old].rc;

                a[now].cnt = a[old].cnt + y;

                a[now].sum = a[old].sum + 1ll * b[x] * y;

                if (l == r) return;

                int mid = (l + r) >> ;

                if (mid >= x) modify(a[now].lc , a[now].lc , l , mid , x , y);

                else modify(a[now].rc , a[now].rc , mid +  , r , x , y);

        }

        inline ll query(int now , int l , int r , ll x)

        {

                if (l == r)

                        return 1ll * b[l] * x;

                int mid = (l + r) >> ;

                if (a[a[now].lc].cnt >= x) return query(a[now].lc , l , mid , x);

                else return a[a[now].lc].sum + query(a[now].rc , mid +  , r , x - a[a[now].lc].cnt);

        }

} PST;

template <typename T> inline void chkmax(T &x,T y) { x = max(x,y); }

template <typename T> inline void chkmin(T &x,T y) { x = min(x,y); }

template <typename T> inline void read(T &x)

{

    T f = ; x = ;

    char c = getchar();

    for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;

    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

    x *= f;

}

inline bool cmp(info a , info b)

{

        return a.d > b.d;

}

int main()

{

        read(n); read(m);

        for (int i = ; i <= n; i++)

        {

                read(a[i].d);

                read(a[i].p);

                read(a[i].l);

                b[i] = a[i].p;

        }

        sort(b +  , b + n + );

        len = unique(b +  , b + n + ) - b - ;

        sort(a +  , a + n +  , cmp);

        for (int i = ; i <= n; i++) a[i].p = lower_bound(b +  , b + len +  , a[i].p) - b;

        PST.build(rt[] ,  , len);

        for (int i = ; i <= n; i++) PST.modify(rt[i] , rt[i - ] ,  , len , a[i].p , a[i].l);

        while (m--)

        {

                ll G , L;

                read(G); read(L);

                int l =  , r = (int)1e5 , ans = ;

                while (l <= r)

                {

                        int mid = (l + r) >> ;

                        int ll =  , rr = n , loc = ;

                        while (ll <= rr)

                        {

                                int md = (ll + rr) >> ;

                                if (a[md].d >= mid)

                                {

                                        ll = md + ;

                                        loc = md;

                                } else rr = md - ;

                        }

                        if (PST.a[rt[loc]].cnt >= L && PST.query(rt[loc] ,  , len , L) <= G)

                        {

                                l = mid + ;

                                ans = mid;

                        } else r = mid - ;

                }

                if (ans == ) puts("-1");

                else printf("%d\n" , ans);

        }

        return ;

}