#include <bits/stdc++.h>

// cut here
#ifdef _MSC_VER
#include <intrin.h>
#endif
 
namespace atcoder {
 
namespace internal {
 
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}
 
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}
 
}  // namespace internal
 
}  // namespace atcoder
 
 
namespace atcoder {
 
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
 
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
 
    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }
 
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;
 
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }
 
    S all_prod() { return d[1]; }
 
    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
 
    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
 
  private:
    int _n, size, log;
    std::vector<S> d;
 
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
 
}  // namespace atcoder
// cut here 

#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define vec vector
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

// snuke's mod int
template <ll mod>
struct modint{
	ll x;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint& operator/=(const modint& a){(x*=a.inv().x)%=mod; return *this;}
	modint operator+(const modint& a)const{return modint(*this)+=a;}
	modint operator-(const modint& a)const{return modint(*this)-=a;}
	modint operator*(const modint& a)const{return modint(*this)*=a;}
	modint operator/(const modint& a)const{return modint(*this)/=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
	bool operator<(const modint& a)const{return x<a.x;}
	bool operator==(const modint& a)const{return x==a.x;}
	bool operator!=(const modint& a)const{return x!=a.x;}
};

using mint=modint<1000000007>;

struct N{
	mint ans=0,sum=0,prod=1;
};

N op(N l,N r){
	N ret;
	ret.ans=r.ans+l.ans*r.prod;
	ret.prod=l.prod*r.prod;
	ret.sum=l.sum+r.sum;
	return ret;
}

N e(){
	return N{0,0,1};
}

void slv(){
	int n,q;
	cin>>n>>q;

	vec<pii> ops(n);
	rep(i,n){
		cin>>ops[i].fi>>ops[i].se;
	}

	vi to(n+1,n);
	per(i,n){
		auto [a,b]=ops[i];
		if(b>1){
			to[i]=i;
		}else{
			to[i]=to[i+1];
		}
	}

	vi ps(n);
	rep(i,n){
		if(i){
			ps[i]+=ps[i-1];
		}
		ps[i]+=ops[i].fi;
	}

	atcoder::segtree<N,op,e> seg(n);
	rep(i,n){
		if(ops[i].se==1){
			seg.set(i,N{ops[i].fi,ops[i].fi,1});
		}else{
			seg.set(i,N{0,0,ops[i].se});
		}
	}

	auto range_sum=[&](int l,int r)->int{
		if(l>r) return 0;
		return ps[r]-(!l?0:ps[l-1]);
	};

	const int LIM=2e9;

	auto get=[&](int x,int l,int r){
		while(x<LIM and l<r){
			int i=to[l];
			if(i<r){
				x+=range_sum(l,i-1);
				if(x>=LIM){
					l=i;
					break;
				}
				x=max(x+ops[i].fi,x*ops[i].se);
			}else{
				x+=range_sum(l,r-1);
				l=r;
				break;
			}
			l=i+1;
		}
		auto val=seg.prod(l,r);
		mint ans=mint(x)*val.prod+val.ans;
		return ans.x;
	};

	rep(_,q){
		int x,l,r;
		cin>>x>>l>>r;
		cout<<get(x,l,r)<<"\n";
	}
}

signed main(){
	ios::sync_with_stdio(0),cin.tie(0);

	int t;
	t=1;
	// cin>>t;

	rep(cs,t){
		slv();
	}
}