#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int C = 1007;
const int N = 10007;
const int mod = 1000000007;

int testcase, F[N][C], G[N][C];

void add(int &a, int b) {a = (a + b >= mod ? a + b - mod : a + b);}

inline void work() {
    printf("Case #%d:\n", ++testcase);
    int n = rd(), m = rd();
    rep(j, 1, 1000) G[0][j] = 0;
    rep(i, 1, n) {
        int a = rd(), b = rd();
        int t = (a + 1) * b;
        rep(j, 0, 1000) F[i][j] = F[i - 1][j];
        if (t <= 1000) rep(j, t, 1000) add(F[i][j], mod - F[i - 1][j - t]);
        rep(j, b, 1000) add(F[i][j], F[i][j - b]);
        rep(j, 0, 1000) G[i][j] = G[i - 1][j];
        rep(j, b, 1000) add(G[i][j], mod - G[i - 1][j - b]);
        if (t <= 1000) rep(j, t, 1000) add(G[i][j], G[i][j - t]);
    }
    rep(i, 0, n) rep(j, 1, 1000) add(G[i][j], G[i][j - 1]);
    int lstans = 0;
    rep(i, 1, m) {
        int l = (rd() + lstans) % n + 1;
        int r = (rd() + lstans) % n + 1;
        if (l > r) swap(l, r);
        int c = rd(), ans = 0;
        rep(i, 0, c) ans = (ans + 1ll * F[r][i] * G[l - 1][c - i]) % mod;
        printf("%d\n", lstans = ans);
    }
}

int main() {
    F[0][0] = G[0][0] = 1;
    per(t, rd(), 1) work();
    return 0;
}