#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

typedef long long ll;
struct Data {
    ll a, b;
};

const int MAX = 1e5 + 2;
const ll oo = 1e17;
vector<Data> a[MAX];
ll l[MAX], r[MAX], b[MAX], n, minn, maxx, total, res;

ll bs(ll l, ll r, ll y, ll x) {
    int mid;
    int res = 0;
    while (l <= r) {
        mid = (l + r) / 2;
        if (a[y][mid].a >= x) {
            res = mid;
            r = mid - 1;
        } else l = mid + 1;
    }
    return res;
}

void solve() {
    cin >> n;
    minn = 0; maxx = 0; total = 0;
    for (int i = 1; i <= n; i++) {
        b[i] = 0;
        int m;
        cin >> m >> l[i] >> r[i];
        total += r[i] - l[i];
        minn += l[i];
        maxx += r[i];
        if (minn > oo) minn = oo;
        if (maxx > oo) maxx = oo;
        Data temp = {
            0,
            0,
        };
        a[i].clear();
        for (int j = 1; j <= m; j++) a[i].push_back(temp);
        for (int j = 1; j <= m; j++) cin >> a[i][j - 1].a;
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j - 1].b;
            b[i] += a[i][j - 1].b;
        }
    }
    map<ll, vector<ll>> m;
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < a[i].size(); j++) m[a[i][j].a].push_back(i);
    }
    for (auto i : m) {
        if (i.first >= minn && i.first <= maxx) cnt++;
    }
    if (cnt < maxx - minn + 1) {
        cout << 0 << "\n";
        return;
    }
    res = LLONG_MAX;
    for (int i = minn; i <= maxx; i++) {
        ll total1 = total;
        ll res1 = 0;
        for (auto j : m[i]) {
            total -= (r[j] - l[j]);
            ll temp = a[j][bs(0, a[j].size() - 1, j, i)].b;
            if (b[j] - temp <= l[j]) res1 += l[j] - (b[j] - temp);
            else if (b[j] - temp <= r[j]) total += b[j] - temp - l[j];
            else total += r[j] - l[j];
        }
        if (total < i - minn) res1 += i - minn - total;
        res = min(res, res1);
        total = total1;
    }
    cout << res << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int t;
    cin >> t;
    while (t--) solve();
}

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
 
#include <bits/stdc++.h>
using namespace std;

const int MAX = 3e5 + 2;
const int oo = 3e5;
vector<int> a[MAX * 2];
int b[MAX], dist[MAX * 2], visited[MAX * 2], pre[MAX * 2], n, s, t, cnt;
vector<int> res;

void BFS(int u) {
    for (int i = 1; i <= oo * 2; i++) {
        dist[i] = -1;
        pre[i] = -1;
    }
    dist[u] = 0;
    queue<int> q;
    q.push(u);
    visited[u] = 1;
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        for (auto i : a[x]) {
            if (visited[i] == 0) {
                visited[i] = 1;
                pre[i] = x;
                dist[i] = dist[x] + 1;
                q.push(i);
            }
        }
    }
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
        for (int j = 2; j <= int(sqrt(b[i])); j++) {
            if (b[i] % j == 0) {
                a[j + oo].push_back(i);
                a[i].push_back(j + oo);
                if (j * j != b[i]) {
                    a[b[i] / j + oo].push_back(i);
                    a[i].push_back(b[i] / j + oo);
                }
            }
        }
        if (b[i] != 1) {
            a[b[i] + oo].push_back(i);
            a[i].push_back(b[i] + oo);
        }
    }
    cin >> s >> t;
    BFS(s);
    if (visited[t] == 0) {
        cout << -1;
        return;
    }
    /*for (int i = 1; i <= n; i++) cout << pre[i] << " ";
    cout << "\n";*/
    /*for (int i = int(3e5) + 1; i <= int(3e5) + 20; i++) {
        for (auto j : a[i]) cout << j << " ";
        cout << "\n";
    }*/
    int k = t;
    cnt = 1;
    res.push_back(k);
    while (pre[k] != -1) {
        k = pre[k];
        cnt++;
        if (cnt % 2 == 1) res.push_back(k);
    }
    cout << res.size() << "\n";
    reverse(res.begin(), res.end());
    for (int i = 0; i < res.size(); i++) cout << res[i] << " ";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	solve();
}