#include <bits/stdc++.h>

#define int long long
#define ll long long
#define double long double
#define all(v) v.begin(), v.end()
#define ii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define maximize(a, b) a = max(a, b)
#define minimize(a, b) a = min(a, b)
#define cbit(n) __builtin_popcount(n)
#define getbit(mask, i) ((mask >> i) & 1LL)
#define onbit(mask, i) (mask | (1LL << i))
#define offbit(mask, i) (mask ^ (1LL << i))
#define TASK "1"

using namespace std;

const int N = 2e5 + 5;
const ll oo = 1e18;
const int base = 311;
//const int sz = sqrt(N);
const int mod = 1e9 + 7;

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int Rand(int l, int r)
{
    return uniform_int_distribution<int> (l, r) (rd);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    if(fopen(TASK".inp", "r")){
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    srand(time(NULL));
    int nTest = 1000;
    for(int test = 1; test <= nTest; test++){
        ofstream inp("test.inp");
        int n = Rand(1, 300), q = Rand(1, 300);
//        n = 500000;
        inp << n << " " << q << "\n";
        for(int i = 1; i <= n; i++) inp << Rand(-100, 100) << " \n"[i == n];
        for(int i = 1; i <= q; i++) inp << Rand(-100, 100) << " \n"[i == q];

        inp.close();
        system("./test");
        system("./test_trau");
        if(system("diff test.out test.ans") != 0) return 0;
        cerr << "Test " << test << ": AC\n";
    }
    return 0;
}