1870B - Friendly Arrays - CodeForces Solution

//Author: Darlanka Praneeth
//date: dd-mm-yyyy : 18-09-2023 || hh-mm-ss : 20:32:04
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 1000000007

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n,m;cin>>n>>m;
        vector<int>a;vector<int>b;
        int pa = 0;
        for(int i=0;i<n;i++){
            int x;cin>>x;
            a.push_back(x);
            pa ^= x;
        }
        for(int i=0;i<m;i++){
            int y;cin>>y;
            b.push_back(y);
        }
        int pa2 = b[0];
        for(int i=1;i<m;i++){
            pa2 |= b[i];
        }
        if(n%2==0){
            int m = ~(pa2);
            cout<<(m&pa)<<" "<<pa<<"\n";
        }
        else{
            cout<<pa<<" "<<(pa2|pa)<<"\n";
        } 
    }
    return 0;
}