//Orz dls! dlstxdy!
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ui unsigned int
#define ull unsigned ll
#define pii pair<int,int>
#define pll pair<ll,ll>
#define db long double
#define mp make_pair
#define X first
#define Y second
#define vi vector<int>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,b,a) for(int i=(b);i>=(a);--i)
#define rep0(i,a,b) for(int i=(a);i<(b);++i)
#define fore(i,a) for(int i=0;i<(a).size();++i)
#define ls x<<1,l,m
#define rs x<<1|1,m+1,r
#define gc getchar
inline ll rd() {
    ll x = 0, w = 1;
    char c = gc();

    while (!isdigit(c) && c != '-')
        c = gc();

    if (c == '-')
        c = gc(), w = -1;

    while (isdigit(c))
        x = x * 10 + c - 48, c = gc();

    return x * w;
}
const int N = 2005;
#define pll pair<ll,ll>
int m;
ll P, T, a[N], b[N], c[N];
vector<pll> merge(vector<pll>a, vector<pll>b) {
    int cnt = 0;
    vector<pll>V, ans;

    for (auto x : a)
        V.pb(mp(x.X, -1)), V.pb(mp(x.Y + 1, 1));

    for (auto x : b)
        V.pb(mp(x.X, -1)), V.pb(mp(x.Y + 1, 1));

    inplace_merge(V.begin(), V.begin() + 2 * a.size(), V.end());

    fore(i, V)if ((cnt -= V[i].Y) == 2)
        ans.pb(mp(V[i].X, V[i + 1].X - 1));

    return ans;
}
void calc(ll l, ll r, ll A, ll d, int t, vector<pll> &ans) {
    db td = d + floor((db)l * A / P - 1) * P;
    db dl = td - (db)t * (T / 2), dr = td + (db)t * (T / 2);

    while (dl / A <= r) {
        if (dr / A >= l)
            ans.pb(mp((ll)(dl / A), (ll)(dr / A)));

        dl += P;
        dr += P;
    }
}
inline ll mul(ll a, ll b) {
    return (a * b - (ll)((db)a * b / P + 0.05) * P + P) % P;
}
inline ll pw(ll a, ll b) {
    ll r = 1;

    for (; b; b >>= 1, a = mul(a, a))
        if (b & 1)
            r = mul(r, a);

    return r;
}
inline bool chk(ll x) {
    rep0(i, 0, m) {
        ll r = (b[i] + P - mul(x, a[i]) + T / 2) % P;

        if (r > T)
            return 0;
    }
    return 1;
}
struct st {
    ll a, l, o;
};
inline bool operator==(const st &x, const st &y) {
    return x.a == y.a && x.l == y.l && x.o == y.o;
}
inline bool operator<(const st &x, const st &y) {
    return x.a < y.a;
}
vector<st>Eq[10];
void sol() {
    m = rd();
    P = rd();
    T = rd();
    rep0(i, 0, m)c[i] = rd(), b[i] = rd();
    ll d = pw(c[0], P - 2);
    rep0(i, 0, m)a[i] = mul(c[i], d);
    vector<st>E;

    rep0(i, 1, m)if (rand() & 1)
        E.pb((st) {
        a[i], b[i], 1
    });
    else
        E.pb((st) {
        P - a[i], P - b[i], 1
    });
    sort(E.begin(), E.end());
    rep0(i, 0, 5) {
        int nn = E.size();

        rep0(i, 0, nn)rep0(j, i + 1, min(i + 5, nn))if (E[i].a != E[j].a)
            E.pb((st) {
            E[j].a - E[i].a, (E[j].l + P - E[i].l) % P, E[j].o + E[i].o
        });

        if (E.size() > 400) {
            nth_element(E.begin(), E.begin() + 400, E.end());
            E.erase(E.begin() + 400, E.end());
        }

        sort(E.begin(), E.end());
        E.erase(unique(E.begin(), E.end()), E.end());

        if (E.size() > 300)
            E.resize(300);

        Eq[i] = E;
    }
    vector<pll>ans;
    calc(b[0] + P - T / 2, b[0] + P + T / 2, E[0].a, E[0].l, E[0].o, ans);
    per(t, 4, 0) {
        E = Eq[t];
        rep(i, 1, 10) {
            ll s = 0;
            fore(j, ans)s += ans[j].Y - ans[j].X + 1;

            if (s < 100)
                break;

            vector<pll>V;
            fore(j, ans)calc(ans[j].X, ans[j].Y, E[i].a, E[i].l, E[i].o, V);
            ans = merge(ans, V);
        }
    }

    fore(i, ans)for (ll x = ans[i].X; x <= ans[i].Y; x++)
        if (chk(x))
            printf("%lld\n", mul(x, d));
}
int main() {
    int TT = rd();

    while (TT--)
        sol();

    return 0;
}