头文件

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <algorithm>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define lp pair<ll, ll>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
ll GCD(ll a, ll b) {//?????
	return b == 0 ? a : GCD(b, a % b);
}
ll Power(ll a, ll b, ll p) {
	ll ans = 1;
	while (b) {
		if (b & 1)ans = ans * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ans;
}
bool isPrime(ll num) {
	if (num == 2 || num == 3)return true;
	if (num % 6 != 1 && num % 6 != 5)return false;
	for (ll i = 5, t = sqrt((double)num); i <= t; i += 6)if (num % i == 0 || num % (i + 2) == 0)return false;
	return true;
}
bool isRunyear(int year) {
	return (year % 4 == 0 && year % 100 != 0 || year % 400 == 0);
}
string add(string s1, string s2) {
	if (s1.length() < s2.length())swap(s1, s2);
	for (ll i = s1.length() - 1, j = s2.length() - 1; i >= 0; i--, j--) {
		s1[i] = char(s1[i] + (j >= 0 ? s2[j] - '0' : 0));
		if (s1[i] - '0' >= 10) {
			s1[i] = char((s1[i] - '0') % 10 + '0');
			if (i) s1[i - 1]++;
			else s1 = '1' + s1;
		}
	}
	return s1;
}
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}
const ll inf = 70000;
const ll mod = 1e9;
ll n, m, i, j, k = 0, t, w, flag, x, y, z;
string s1, s2, s;

int main() {

	return 0;
}