[TOI 2020 0th] C. 銀河捷運

// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

void solve() {
    int M, a, b, x1, y1, x2, y2, x3, y3, m, k;
    cin >> M >> a >> b >> x1 >> y1 >> x2 >> y2;

    auto fastpow = [=](int base, int exp, int ans = 1) {
        while (exp) {
            if (exp & 1) ans = ans * base % M;
            base = base * base % M, exp >>= 1;
        }
        return ans;
    };

    auto ADD = [=](int _a, int _b) {
        return ((_a + _b) % M + M) % M;
    };

    auto SUB = [=](int _a, int _b) {
        return ((_a - _b) % M + M) % M;
    };

    m = SUB(y2, y1) * fastpow(SUB(x2, x1), M-2) % M;
    k = SUB(y1, m * x1);

    x3 = SUB(m * m, x1 + x2);
    y3 = ADD(m * x3, k);

    cout << x3 << " " << y3 << "\n";
}

int32_t main() {
    fastIO();

    int t;
    cin >> t;
    while (t--) solve();

    return 0;
}