#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, q;
    std::cin >> n >> q;

    std::vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }

    std::vector<int> b(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> b[i];
    }

    std::vector<std::vector<std::pair<int, int>>> qry(n);
    for (int i = 0; i < q; ++i) {
        int l, r;
        std::cin >> l >> r;
        --l;
        qry[l].emplace_back(r, i);
    }

    std::vector<int> s(n + 1);
    for (int i = n - 1; i >= 0; --i) {
        s[i] = s[i + 1] + b[i];
    }

    std::vector<int> ans(q);
    for (int bit = 0; bit < 30; ++bit) {
        int fst = n;
        for (int l = n - 1; l >= 0; --l) {
            for (int i = l; i < n; ++i) {
                if ((a[l] + s[i] - s[l]) >> bit & 1) {
                    fst = std::min(fst, i);
                    break;
                }
            }

            for (auto [r, id] : qry[l]) {
                if (fst < r) {
                    ans[id] += 1 << bit;
                }
            }
        }
    }

    constexpr int P = 998244353, B = 233;

    int res = 0, coef = 1;
    for (int i = 0; i < q; ++i) {
        coef = 1ll * coef * B % P;
        res = (res + 1ll * ans[i] * coef) % P;
    }
    std::cout << res << "\n";

    // for (int i = 0; i < q; ++i) {
    //     std::cout << ans[i] << "\n";
    // }
}

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}