#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include "icc.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int mxn = 1e2;
int aux1[mxn], aux2[mxn];

int send_query(vector<int> &a, vector<int> &b) {
	for (int i = 0; i < sz(a); i++) {
		aux1[i] = a[i];
	}
	for (int i = 0; i < sz(b); i++) {
		aux2[i] = b[i];
	}
	return query(sz(a), sz(b), aux1, aux2);
	
}

void run(int n) {
	vector<int> t1 = {1};
	vector<int> t2 = {2};
	send_query(t1,t2);
}

/*
signed main() {
		
	return 0;
}*/