#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>
#include <array>
#include <cstdio>
namespace fast_io {
const int BUF_SIZE = 1 << 21;
char buf[BUF_SIZE], *p1 = buf, *p2 = buf;
}
const int BIG_INT_LIMBS = 8;
const unsigned long long BASE = 1'000'000'000;
const int MOD = (1 << 30) - 1;
struct big_int {
std::array<unsigned long long, BIG_INT_LIMBS> num;
int len;
};
void square(const big_int& n, big_int& result) {
result.num.fill(0);
if (n.len == 0 || (n.len == 1 && n.num[0] == 0)) {
result.len = 1;
return;
}
}
const int MAX_N = 40000000 + 3;
stdvector<unsigned long long> prefix_sum(MAX_N);
stdvector<int> parent(MAX_N);
std::vector<int> q_deque(MAX_N);
void solve() {
int n, type;
fast_ioread(n);
fast_ioread(type);
}
int main() {
stdios_basesync_with_stdio(false);
std::cin.tie(NULL);
solve();
return 0;
}
