#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define Min(a,b) ((a)>(b)?(b):(a))

#define Max(a,b) ((a)>(b)?(a):(b))

const ll mod = 1e9 + 7;

const int maxn = 5e5 + 13;

ll E[maxn], Sum[maxn];

ll inv(ll a, ll m)

{

    if(a == 1)

        return 1;

    return inv(m%a, m)*(m - m/a)%m;

}

int main()

{

    // freopen("input.txt", "r", stdin);

    // freopen("out.txt", "w", stdout);

    int T;

    scanf("%d", &T);

    while(T--)

    {

        E[1] = 0;

        Sum[0] = 0;

        int N, Q, qL, qR;

        ll R, S, X, A;

        scanf("%d%d", &N, &Q);

        for(int i = 1; i <= N; i++)

        {

            scanf("%lld%lld%lld%lld", &R, &S, &X, &A);

            ll deta = Sum[i-1] - Sum[X-1];

            E[i] = (((deta + A) * S % mod * inv(R, mod) % mod)- deta + mod ) % mod;

            Sum[i] = (Sum[i-1] + E[i])%mod;

            // cout << i << "  " << E[i] << " " << Sum[i] << endl;

        }

        for(int i = 1; i <= Q; i++)

        {

            scanf("%d%d", &qL, &qR);

            printf("%lld\n", (Sum[qR - 1] - Sum[qL-1] + mod)%mod );

        }

    }

    return 0;

}

/*

1

3 2

1 1 1 2

1 2 1 3

1 3 3 4

1 4

3 4

*/