#1189616 (C++23(gcc16)) No.3721 Absurd Basic Constructive

• 問題: No.3721 Absurd Basic Constructive
• ユーザー: genno360
• 提出日時: 2026-09-19 18:47:28
• 言語: C++23(gcc16) (gcc 16.1.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 338 ms / 2,000 ms
• コード長: 44,367 bytes
• コンパイル時間: 5,966 ms
• コンパイル使用メモリ: 404,224 KB
• 実行使用メモリ: 54,400 KB
• 最終ジャッジ日時: 2026-09-19 18:47:47
• 合計ジャッジ時間: 16,910 ms
• ジャッジサーバーID （参考情報）: judge4_0 / judge1_0

ファイルパターン	結果
sample	AC * 2
other	AC * 47

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
/*	using	*/
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;

using mint = modint998244353;
/*	マクロ	*/
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REP(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define repm(i, a, n, m) for (ll i = a; i < (ll)(n); i += m)
#define rrep(i, a, n) for (ll i = a; i >= (ll)(n); i--)

//#define rep(i, A, n) for (int i = A; i < (n); i++)
//#define REP(i, A, n) for (int i = A; i <= (n); i++)
//#define repm(i, A, n, m) for (int i = A; i < (n); i += m)
//#define rrep(i, A, n) for (int i = A; i >= (n); i--)
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define debug(x) cerr << #x << " = " << x << el
#define el '\n'

//#define HEURISTIC

template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
inline void YN(bool ok) {
	cout << (ok ? "Yes" : "No") << el;
}
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const int DX[4] = { -1, 1, 0, 0 };
const int DY[4] = { 0, 0, -1, 1 };

const ll INF = LLONG_MAX / 4;

/*	演算子オーバーロード	*/

/* pair */
template<typename T>
std::pair<T, T> operator+(const std::pair<T, T>& a, const std::pair<T, T>& b) {
	return { a.first + b.first, a.second + b.second };
}

template<typename T>
std::pair<T, T> operator-(const std::pair<T, T>& a, const std::pair<T, T>& b) {
	return { a.first - b.first, a.second - b.second };
}

template<typename T>
std::pair<T, T> operator*(const std::pair<T, T>& a, const std::pair<T, T>& b) {
	return { a.first * b.first, a.second * b.second };
}
template<typename T1, typename T2>
istream& operator >> (istream& is, std::pair<T1, T2>& p) {
	is >> p.first >> p.second;
	return is;
}
template<typename T1, typename T2>
std::ostream& operator<< (std::ostream& os, std::pair<T1, T2> p) {
	os << p.first << " " << p.second;
	return os;
}
/*	標準出力系	*/
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); } }init;
template<typename T>
istream& operator >> (istream& is, vector<T>& vec) {
	for (T& x : vec) is >> x;
	return is;
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for (int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
	bool first = true;
	for (const auto& x : st) {
		if (!first) os << ' ';
		first = false;
		os << x;
	}
	return os;
}
template<typename K, typename V>
ostream& operator<<(ostream& os, const map<K, V>& mp) {
	bool first = true;
	for (const auto& [k, v] : mp) {
		if (!first) os << ' ';
		first = false;
		os << k << ':' << v;
	}
	return os;
}

#ifdef _DEBUG

template<class T>
struct DebugMultiset : std::multiset<T> {
	using Base = std::multiset<T>;
	using Base::Base;
	using Base::erase;

	void erase(const T& x) {
		cerr << "WARNING: multiset::erase(value) は同じ値全消しです\n";
		cerr << "ポインタならひとつだけ消せる\n";
		assert(false);
	}
};

#define multiset DebugMultiset

#else

#define multiset std::multiset

#endif

/*	乱数	*/
struct Xorshift128 {
	uint64_t x = 123456789, y = 362436069, z = 521288629, w = 88675123;
	inline uint64_t next() {
		uint64_t t = x ^ (x << 11);
		x = y; y = z; z = w;
		return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
	}
	inline int next_int(int n) {
		return (int)(next() % (uint64_t)n);
	} inline double next_double()
	{
		return (next() >> 11) * (1.0 / 9007199254740992.0);
	}
} rng;

inline double random_real_0_1() {
	return rng.next_double();
}
inline int random_int_range(int a, int b) {
	return a + rng.next_int(b - a);
}
template<class T>
inline T random_pickup(const vector<T>& v) {
	return v[rng.next_int((int)v.size())];
}
template<class T>
inline void shuffle_vector(vector<T>& v) {
	for (int i = (int)v.size() - 1; i > 0; --i) {
		int j = rng.next_int(i + 1); // [0, i]
		std::swap(v[i], v[j]);
	}
}

class TIMER {
	chrono::system_clock::time_point start;
public:
	TIMER() : start(chrono::system_clock::now()) {}
	void reset() {
		start = chrono::system_clock::now();
	}
	double count() {
		chrono::duration<double> Time_ = chrono::system_clock::now() - start;
		return Time_.count();
	}

	bool is_under(double x) {
		return (this->count()) < x;
	}

};

/*	演算	*/

template<typename T>
T pow_int(T base, unsigned int exponent) {
	T result = 1;
	while (exponent > 0) {
		if (exponent & 1) {  // 奇数の場合
			result *= base;
		}
		base *= base;
		exponent >>= 1;  // 2で割る
	}
	return result;
}

template<typename T>
double euclid(T& a, T& b) {
	ll dx = a.first - b.first;
	ll dy = a.second - b.second;
	return sqrt(dx * dx + dy * dy);
}
template<typename T>
double euclid(T& ax, T& ay, T& bx, T& by) {
	ll dx = ax - bx;
	ll dy = ay - by;
	return sqrt(dx * dx + dy * dy);
}
template<typename T>
T getDistanceSq(pair<T, T> p1, pair<T, T>  p2) {
	return (p1.first - p2.first) * (p1.first - p2.first) + (p1.second - p2.second) * (p1.second - p2.second);
}
template<typename T>
ll manhattan(T& a, T& b) {
	return abs(a.first - b.first) + abs(a.second - b.second);
}
template<typename T>
ll manhattan(T& ax, T& ay, T& bx, T& by) {
	return abs(ax - bx) + abs(ay - by);
}
vector<int> manacher(string& str) {
	//その文字を中心とした最長の回文の半径を計算する
	vector<int> res(str.size());
	int i = 0, j = 0;
	while (i < str.size()) {
		while (i - j >= 0 && i + j < str.size() && str[i - j] == str[i + j]) ++j;
		res[i] = j;
		int k = 1;
		while (i - k >= 0 && k + res[i - k] < j) res[i + k] = res[i - k], ++k;
		i += k; j -= k;
	}
	return res;
}

vector<ll> cumulative_sum(const vector<ll>& A) {//累積和 元配列 A の区間 [l, r) の和は B[r] - B[l]
	vector<ll> B;
	B.push_back(0);
	rep(i, 0, A.size()) {
		B.push_back(B.back() + A[i]);
	}
	return B;
}

template<typename T>
vector<pair<T, int>> RLE(const vector<T>& A) { //ランレングス圧縮
	vector<pair<T, int>> ans;
	if (A.empty()) return ans;

	ans.push_back({ A[0], 1 });

	for (size_t i = 1; i < A.size(); i++) {
		if (ans.back().first == A[i]) {
			ans.back().second++;
		}
		else {
			ans.push_back({ A[i], 1 });
		}
	}
	return ans;
}
bool isInArea(int a, int b, int H, int W) {
	return a >= 0 && b >= 0 && a < H && b < W;
}
//素数列挙(n以下)
vector < ll > era(int n) {
	vector < bool > isprime;
	isprime.resize(n, true);
	vector < ll > res;
	isprime[0] = false;
	isprime[1] = false;
	for (ll i = 2; i < n; ++i) isprime[i] = true;
	for (ll i = 2; i < n; ++i) {
		if (isprime[i]) {
			res.push_back(i);
			for (ll j = i * 2; j < n; j += i) isprime[j] = false;
		}
	}
	return res;
}
template <typename T>
vector<pair<T, T>> prime_factor(T n) {//素因数分解
	vector<pair<T, T>> ret;
	for (T i = 2; i * i <= n; i++) {
		if (n % i != 0) continue;
		T tmp = 0;
		while (n % i == 0) {
			tmp++;
			n /= i;
		}
		ret.push_back(make_pair(i, tmp));
	}
	if (n != 1) ret.push_back(make_pair(n, 1));
	return ret;
}
int gcd(int a, int b) {//最大公約数
	if (a % b == 0) {
		return b;
	}
	else {
		return gcd(b, a % b);
	}
}

ll from_base_n(int base, const vector<ll>& digits) {//n進数を数字に
	ll value = 0;
	ll power = 1;
	for (ll d : digits) {
		value += d * power;
		power *= base;
	}
	return value;
}

vector<ll> to_base_m(ll value, int base) {//数字をn進数に
	if (value == 0) return { 0 };
	vector<ll> digits;
	while (value > 0) {
		digits.push_back(value % base);
		value /= base;
	}
	return digits;
}

vector<ll> convert_base_digits(//a進数をb進数に
	int from_base,
	int to_base,
	const vector<ll>& digits
) {
	return to_base_m(from_base_n(from_base, digits), to_base);
}


struct C2 {//二項係数

	C2(int n = 3000) {
		C.resize(n + 10, vector<ll>(n + 10));
		for (int i = 0; i <= n; i++) {
			for (int j = 0; j <= i; j++) {
				if (j == 0 || j == i) {
					C[i][j] = 1;
				}
				else {
					C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
				}
			}
		}
	}

	ll get(ll A, ll B) {
		if (A < B) return 0;
		if (A < 0 || B < 0) return 0;
		return C[A][B];
	}
private:
	vector<vector<ll>> C;
};

struct Combination {// modint用二項係数を扱う構造体
	std::vector<mint> fac, finv, inv;

	// コンストラクタで最大値 (MAX) を指定してテーブルを初期化
	Combination(int max_val = 700000) : fac(max_val), finv(max_val), inv(max_val) {
		const int MOD = mint::mod();
		fac[0] = fac[1] = 1;
		finv[0] = finv[1] = 1;
		inv[1] = 1;

		for (int i = 2; i < max_val; i++) {
			fac[i] = fac[i - 1] * i;
			inv[i] = MOD - inv[MOD % i] * (MOD / i);
			finv[i] = finv[i - 1] * inv[i];
		}
	}

	// nCk を計算
	mint operator()(int n, int k) const {
		if (n < k || n < 0 || k < 0) return 0;
		return fac[n] * finv[k] * finv[n - k];
	}

	// 順列 nPk も必要な場合に
	mint P(int n, int k) const {
		if (n < k || n < 0 || k < 0) return 0;
		return fac[n] * finv[n - k];
	}

	// 重複組合せ nHk (= n+k-1 C k)
	mint H(int n, int k) const {
		if (n < 0 || k < 0) return 0;
		if (n == 0 && k == 0) return 1;
		return (*this)(n + k - 1, k);
	}
};

/*	class	*/
/* グラフ */

/*	class	*/
class GraphAlgo {
public:
	GraphAlgo() = default;
	GraphAlgo(int N) {
		concat.resize(N);

	}
	GraphAlgo(int N, int M, vector<pii>& vec) {
		assert(vec.size() == M);
		concat.resize(N);
		rep(i, 0, M)add_bidir(vec[i].first, vec[i].second);
	}
	GraphAlgo(vector<vector<char>>& S, char c) {

		int H, W;
		H = S.size();
		W = S[0].size();
		concat.resize(H * W);
		rep(i, 0, H)rep(j, 0, W - 1) {
			if (S[i][j] == c && S[i][j + 1] == c) {
				add_bidir(i * W + j, i * W + (j + 1));
			}
		}
		rep(i, 0, H - 1)rep(j, 0, W) {
			if (S[i][j] == c && S[i + 1][j] == c) {
				add_bidir(i * W + j, (i + 1) * W + j);
			}
		}

	}
	void add(int a, int b) { concat[a].insert(b); }
	void add_bidir(int a, int b) { add(a, b); add(b, a); }
	void remove(int a, int b) { concat[a].erase(b); }
	void remove_bidir(int a, int b) { remove(a, b); remove(b, a); }
	bool find(int a, int b) { return concat[a].find(b) != concat[a].end(); }
	//深さ優先探索して連結成分を得る
	void dfs(int v, set<int>& visited) {
		if (visited.count(v)) return;
		visited.insert(v);
		for (int u : concat[v]) {
			dfs(u, visited);
		}
	}
	void dfs(int v, vector<bool>& visited) {
		if (visited[v]) return;
		visited[v] = true;
		for (int u : concat[v]) {
			dfs(u, visited);
		}
	}
	//幅優先探索してstartからの最短距離を得る
	map<int, int> bfs(int start) {
		map<int, int> dist;
		queue<int> q;
		q.push(start);
		dist[start] = 0;
		while (!q.empty()) {
			int v = q.front(); q.pop();
			for (int u : concat[v]) {
				if (!dist.count(u)) {
					dist[u] = dist[v] + 1;
					q.push(u);
				}
			}
		}
		return dist;
	}
	//幅優先探索して任意の場所からstartへ行く最短経路を返す

	void bfs(int start,
		map<int, int>& dist,
		map<int, int>& route) {


		queue<int> q;
		q.push(start);
		dist[start] = 0;

		while (!q.empty()) {
			int v = q.front(); q.pop();
			for (int u : concat[v]) {
				if (!dist.count(u)) {
					dist[u] = dist[v] + 1;
					route[u] = v;
					q.push(u);
				}
			}
		}
		return;
	}
	//無向グラフの閉路検出
	//有向グラフ向けではない
	bool dfs_cycle(int v, int parent, vector<bool>& visited) {

		visited[v] = true;
		for (int u : concat[v]) {
			if (!visited[u]) {
				if (dfs_cycle(u, v, visited)) return true;
			}
			else if (u != parent) {
				// 親以外の訪問済み頂点に戻る → サイクル
				return true;
			}
		}
		return false;
	}

	void print_debug() {
		//この形式にする
		//https://emkjp.github.io/WebTools/dot.html
		cerr << "https://emkjp.github.io/WebTools/dot.html" << el;
		rep(i, 0, concat.size()) {
			for (auto c : concat[i]) {
				cerr << i << " " << c << el;
			}
		}

	}
	vector<set<int>> concat;

};
class WeightGraphAlgo {//辺に重みがある
public:
	WeightGraphAlgo() = default;
	WeightGraphAlgo(int N) {
		concat.resize(N);
	}
	WeightGraphAlgo(int N, int M, vector<int>& A, vector<int>& B, vector<ll>& C) {
		assert(A.size() == M);
		assert(B.size() == M);
		assert(C.size() == M);
		concat.resize(N);
		rep(i, 0, M)add_bidir(A[i], B[i], C[i]);
	}
	void add(int a, int b, ll c) { concat[a].insert({ b,c }); }
	void add_bidir(int a, int b, ll c) { add(a, b, c); add(b, a, c); }
	void remove(int a, int b, ll c) { concat[a].erase({ b, c }); }
	void remove_bidir(int a, int b, ll c) { remove(a, b, c); remove(b, a, c); }

	vector<ll> dijkstra(int start) {//ダイクストラ
		int N = concat.size();
		vector<ll> dist(N, INF);
		dist[start] = 0;

		priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> pq;
		pq.push({ 0, start });

		while (!pq.empty()) {
			auto [cd, v] = pq.top(); pq.pop();
			if (cd > dist[v]) continue;

			for (auto& nx : concat[v]) {
				int to = nx.first;
				ll cost = nx.second;
				if (dist[to] > cd + cost) {
					dist[to] = cd + cost;
					pq.push({ dist[to], to });
				}
			}
		}
		return dist;
	}
	vector<vector<ll>> warshall_floyd() {//ワ―シャルフロイド
		int N = concat.size();
		vector<vector<ll>> dist(N, vector<ll>(N, INF));

		for (int i = 0; i < N; i++) dist[i][i] = 0;
		for (int i = 0; i < N; i++) {
			for (auto& nx : concat[i]) {
				dist[i][nx.first] = min(dist[i][nx.first], nx.second);
			}
		}

		for (int k = 0; k < N; k++) {
			for (int i = 0; i < N; i++) {
				if (dist[i][k] == INF) continue;
				for (int j = 0; j < N; j++) {
					if (dist[k][j] == INF) continue;
					dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);//kを経由したほうがより近いなら、i->jの最短距離を更新
				}
			}
		}

		return dist;
	}
	void print_debug() {
		//この形式にする
		//https://emkjp.github.io/WebTools/dot.html
		cerr << "https://emkjp.github.io/WebTools/dot.html" << el;
		rep(i, 0, concat.size()) {
			for (auto c : concat[i]) {
				cerr << i << " " << c << el;
			}
		}

	}
	vector<set<pair<int, ll>>> concat;
};
class GraphHeuristic {
public:
	GraphHeuristic() = default;
	GraphHeuristic(int N) {
		concat.resize(N);
		pos.resize(N, vector<int>(N, -1));
	}
	GraphHeuristic(int N, int M, vector<pii>& vec) {
		assert(vec.size() == M);
		concat.resize(N);
		pos.resize(N, vector<int>(N, -1));
		rep(i, 0, M)add_bidir(vec[i].first, vec[i].second);
	}
	GraphHeuristic(vector<vector<char>>& S, char c) {

		int H, W;
		H = S.size();
		W = S[0].size();
		concat.resize(H * W);
		pos.resize(H * W, vector<int>(H * W, -1));
		rep(i, 0, H)rep(j, 0, W - 1) {
			if (S[i][j] == c && S[i][j + 1] == c) {
				add_bidir(i * W + j, i * W + (j + 1));
			}
		}
		rep(i, 0, H - 1)rep(j, 0, W) {
			if (S[i][j] == c && S[i + 1][j] == c) {
				add_bidir(i * W + j, (i + 1) * W + j);
			}
		}

	}
	void add(int a, int b) {
		pos[a][b] = concat[a].size();
		concat[a].push_back(b);
	}
	void add_bidir(int a, int b) { add(a, b); add(b, a); }

	void remove(int a, int b) {
		int i = pos[a][b];
		int w = concat[a].back();

		concat[a][i] = w;
		pos[a][w] = i;

		concat[a].pop_back();
		pos[a][b] = -1;
	}
	void remove_bidir(int a, int b) { remove(a, b); remove(b, a); }
	bool find(int a, int b) { return pos[a][b] != -1; }
	//深さ優先探索して連結成分を得る
	void dfs(int start, set<int>& visited) {
		stack<int> st;
		st.push(start);

		while (!st.empty()) {
			int v = st.top();
			st.pop();

			if (visited.count(v)) continue;
			visited.insert(v);

			for (int u : concat[v]) {
				if (!visited.count(u)) {
					st.push(u);
				}
			}
		}
	}
	void dfs(int start, vector<bool>& visited) {
		stack<int> st;
		st.push(start);

		while (!st.empty()) {
			int v = st.top();
			st.pop();

			if (visited[v]) continue;
			visited[v] = true;

			for (int u : concat[v]) {
				if (!visited[u]) {
					st.push(u);
				}
			}
		}
	}

	//幅優先探索してstartからの最短距離を得る
	map<int, int> bfs(int start) {
		map<int, int> dist;
		queue<int> q;
		q.push(start);
		dist[start] = 0;
		while (!q.empty()) {
			int v = q.front(); q.pop();
			for (int u : concat[v]) {
				if (!dist.count(u)) {
					dist[u] = dist[v] + 1;
					q.push(u);
				}
			}
		}
		return dist;
	}
	//幅優先探索して任意の場所からstartへ行く最短経路を返す
	//以下を初期化しておく
	//vector<int> dist(N, -1);   // -1 = 未訪問
	//vector<int> route(N, -1);  // 親
	void bfs(int start,
		vector<int>& dist,
		vector<int>& route) {

		vector<int> q;
		q.reserve(dist.size());

		int head = 0;
		q.push_back(start);
		dist[start] = 0;

		while (head < (int)q.size()) {
			int v = q[head++];

			for (int u : concat[v]) {
				if (dist[u] == -1) {
					dist[u] = dist[v] + 1;
					route[u] = v;
					q.push_back(u);
				}
			}
		}
	}

	void print_debug() {
		//この形式にする
		//https://emkjp.github.io/WebTools/dot.html
		cerr << "https://emkjp.github.io/WebTools/dot.html" << el;
		rep(i, 0, concat.size()) {
			for (auto c : concat[i]) {
				cerr << i << " " << c << el;
			}
		}

	}
	vector<vector<int>> concat;
	vector<vector<int>> pos;	//index_map
};
class WeightGraphHeuristic {//辺に重みがある
public:
	WeightGraphHeuristic() = default;
	WeightGraphHeuristic(int N) {
		concat.resize(N);
		pos.resize(N, vector<int>(N, -1));
	}
	WeightGraphHeuristic(int N, int M, vector<int>& A, vector<int>& B, vector<ll>& C) {
		assert(A.size() == M);
		assert(B.size() == M);
		assert(C.size() == M);
		concat.resize(N);
		pos.resize(N, vector<int>(N, -1));
		rep(i, 0, M)add_bidir(A[i], B[i], C[i]);
	}
	void add(int a, int b, ll c) {
		pos[a][b] = concat[a].size();
		concat[a].push_back({ b, c });
	}
	void add_bidir(int a, int b, ll c) { add(a, b, c); add(b, a, c); }
	void remove(int a, int b) {
		int i = pos[a][b];
		auto last = concat[a].back();   // {to, weight}

		concat[a][i] = last;
		pos[a][last.first] = i;

		concat[a].pop_back();
		pos[a][b] = -1;
	}
	void remove_bidir(int a, int b, ll c) { remove(a, b); remove(b, a); }
	bool find(int u, int v) const {
		return pos[u][v] != -1;
	}
	void update_weight(int u, int v, ll w) {
		concat[u][pos[u][v]].second = w;
	}
	vector<ll> dijkstra(int start) {//ダイクストラ
		int N = concat.size();
		vector<ll> dist(N, INF);
		dist[start] = 0;

		priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> pq;
		pq.push({ 0, start });

		while (!pq.empty()) {
			auto [cd, v] = pq.top(); pq.pop();
			if (cd > dist[v]) continue;

			for (auto& nx : concat[v]) {
				int to = nx.first;
				ll cost = nx.second;
				if (dist[to] > cd + cost) {
					dist[to] = cd + cost;
					pq.push({ dist[to], to });
				}
			}
		}
		return dist;
	}
	vector<vector<ll>> warshall_floyd() {//ワ―シャルフロイド
		int N = concat.size();
		vector<vector<ll>> dist(N, vector<ll>(N, INF));

		for (int i = 0; i < N; i++) dist[i][i] = 0;
		for (int i = 0; i < N; i++) {
			for (auto& nx : concat[i]) {
				dist[i][nx.first] = min(dist[i][nx.first], nx.second);
			}
		}

		for (int k = 0; k < N; k++) {
			for (int i = 0; i < N; i++) {
				if (dist[i][k] == INF) continue;
				for (int j = 0; j < N; j++) {
					if (dist[k][j] == INF) continue;
					dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);//kを経由したほうがより近いなら、i->jの最短距離を更新
				}
			}
		}

		return dist;
	}
	void print_debug() {
		//この形式にする
		//https://emkjp.github.io/WebTools/dot.html
		cerr << "https://emkjp.github.io/WebTools/dot.html" << el;
		rep(i, 0, concat.size()) {
			for (auto c : concat[i]) {
				cerr << i << " " << c << el;
			}
		}

	}
	vector<vector<pair<int, ll>>> concat;
	vector<vector<int>> pos;
};


#ifdef HEURISTIC
namespace graph_impl {
	using Graph = GraphHeuristic;
	using WGraph = WeightGraphHeuristic;
}
#else
namespace graph_impl {
	using Graph = GraphAlgo;
	using WGraph = WeightGraphAlgo;
}
#endif
using GRAPH = graph_impl::Graph;
using WGRAPH = graph_impl::WGraph;


struct Idx2D {
	void init(int h, int w) {
		H = h;
		W = w;
	}
	void init(int n) {
		H = n;
		W = n;
	}

	int to_id(int h, int w) {
#ifdef _DEBUG
		assert(0 <= h);
		assert(0 <= w);
		assert(h < H);
		assert(w < W);
#endif
		return h * W + w;
	}
	pii to_coord(int k) {
#ifdef _DEBUG
		assert(k < H * W);
#endif
		return { k / W,k % W };
	}
	int H = 0;
	int W = 0;
};

class UNIONFIND
{
public:

	UNIONFIND() = default;

	explicit UNIONFIND(size_t n)
		: m_parents(n)
		, m_sizes(n, 1)
	{
		std::iota(m_parents.begin(), m_parents.end(), 0);
	}

	int find(int i) {
		if (m_parents[i] == i)
		{
			return i;
		}
		return (m_parents[i] = find(m_parents[i]));
	}
	void merge(int a, int b) {
		a = find(a);
		b = find(b);

		if (a != b)
		{
			if (m_sizes[a] < m_sizes[b])
			{
				std::swap(a, b);
			}

			m_sizes[a] += m_sizes[b];
			m_parents[b] = a;
		}
	}

	bool connected(int a, int b) {
		return (find(a) == find(b));
	}

	int size(int i) {
		return m_sizes[find(i)];
	}

private:

	std::vector<int> m_parents;
	std::vector<int> m_sizes;
};

template<class T, class Op>
//セグメントツリー
// 宣言は SEGMENTTREE<ll, SumOp> seg_sum;というように
//initで初期化(長さN、各要素e)
// //updateでpos番目をxに更新 /
// /queryでl番目からr番目の区間の演算値を得る
class SEGMENTTREE {
public:
	int siz;
	vector<T> dat;
	Op op;

	void init(int N) {
		siz = 1;
		while (siz < N) siz <<= 1;
		dat.assign(siz * 2, op.id());
	}

	void update(int pos, T x) {
		pos += siz;
		dat[pos] = x;
		while (pos > 1) {
			pos >>= 1;
			dat[pos] = op(dat[pos * 2], dat[pos * 2 + 1]);
		}
	}

	T query(int l, int r) const {
		T vl = op.id(), vr = op.id();
		l += siz; r += siz;
		while (l < r) {
			if (l & 1) vl = op(vl, dat[l++]);
			if (r & 1) vr = op(dat[--r], vr);
			l >>= 1; r >>= 1;
		}
		return op(vl, vr);
	}
};
struct SumOp {
	ll operator()(ll a, ll b) const { return a + b; }
	ll id() const { return 0; }
};

struct MaxOp {
	ll operator()(ll a, ll b) const { return max(a, b); }
	ll id() const { return LLONG_MIN; }
};

struct MinOp {
	ll operator()(ll a, ll b) const { return min(a, b); }
	ll id() const { return LLONG_MAX; }
};

//フェネック木(フェネックツリー)
// 一点更新 + 区間和取得をどちらも O(log N) で行えるデータ構造
// 別名 BIT (Binary Indexed Tree)
/* 使用例

	FenwickTree fw(100);

	fw.add(5,10);

	cout<<fw.sum(0,5)<<endl;
*/
struct FenwickTree {
	int n;
	vector<long long> bit;

	FenwickTree(int n) :n(n) {
		bit.assign(n + 1, 0);
	}

	void add(int idx, long long val) {
		idx++;

		while (idx <= n) {
			bit[idx] += val;
			idx += idx & -idx;
		}
	}

	long long sum_prefix(int idx) {
		idx++;

		long long res = 0;

		while (idx > 0) {
			res += bit[idx];
			idx -= idx & -idx;
		}

		return res;
	}

	long long sum(int l, int r) {
		if (l > r) return 0;

		return sum_prefix(r)
			- (l ? sum_prefix(l - 1) : 0);
	}
};
// IntervalSet （出典：drken1215）
// ライセンス：CC0 1.0
// 参照元：github.com/drken1215/algorithm

//l以上r未満の区間を管理する
template<class T, class VAL = long long> struct IntervalSet {
	struct Node {
		T l, r;
		VAL val;
		Node(const T& l, const T& r, const VAL& val) : l(l), r(r), val(val) {}
		constexpr bool operator < (const Node& rhs) const {
			if (l != rhs.l) return l < rhs.l;
			else return r < rhs.r;
		}
		friend ostream& operator << (ostream& s, const Node& e) {
			return s << "([" << e.l << ", " << e.r << "): " << e.val << ")";
		}
	};

	// internal values
	const VAL identity;
	set<Node> S;

	// constructor
	IntervalSet(const VAL& identity = VAL()) : identity(identity) {}
	IntervalSet(const vector<VAL>& v, const VAL& identity = VAL()) : identity(identity) {
		vector<Node> vec;
		for (int l = 0; l < (int)v.size();) {
			int r = l;
			while (r < (int)v.size() && v[r] == v[l]) r++;
			vec.emplace_back(l, r, v[l]);
			l = r;
		}
		S = set<Node>(vec.begin(), vec.end());
	}

	constexpr typename set<Node>::iterator begin() { return S.begin(); }
	constexpr typename set<Node>::iterator end() { return S.end(); }

	constexpr typename set<Node>::iterator get(const T& p) {
		auto it = S.upper_bound(Node(p, numeric_limits<T>::max(), 0));
		if (it == S.begin()) return S.end();
		it = move(it);
		if (it->l <= p && p < it->r) return it;
		else return S.end();
	}

	// 点pを含む区間を検索
	constexpr typename set<Node>::iterator lower_bound(const T& p) {
		auto it = get(p);
		if (it != S.end()) return it;
		return S.upper_bound(Node(p, numeric_limits<T>::max(), 0));
	}

	// どこかに含まれているか
	constexpr bool covered(const T& p) {
		auto it = get(p);
		if (it != S.end()) return true;
		else return false;
	}
	constexpr bool covered(const T& l, const T& r) {
		assert(l <= r);
		if (l == r) return true;
		auto it = get(l);
		if (it != S.end() && r <= it->r) return true;
		else return false;
	}

	// 同じ区間か?
	constexpr bool same(const T& p, const T& q) {
		if (!covered(p) || !covered(q)) return false;
		return get(p) == get(q);
	}

	//値を取得
	constexpr VAL get_val(const T& p) {
		auto it = get(p);
		if (it != S.end()) return it->val;
		else return identity;
	}
	VAL operator [] (const T& p) const {
		return get_val(p);
	}

	// 最小の未使用値
	constexpr T get_mex(const T& p = 0) {
		auto it = S.upper_bound(Node(p, numeric_limits<T>::max(), 0));
		if (it == S.begin()) return p;
		it = move(it);
		if (it->l <= p && p < it->r) return it->r;
		else return p;
	}

	// update [l, r) with value val / insert [l, r)
	// del: reflect effects of interval-delete
	// add: reflect effects of interval-add
	// add and del should be reversed operation each other
	template<class ADDFUNC, class DELFUNC> void update(T l, T r, const VAL& val, const ADDFUNC& add, const DELFUNC& del) {
		auto it = S.lower_bound(Node(l, 0, val));
		while (it != S.end() && it->l <= r) {
			if (it->l == r) {
				if (it->val == val) {
					r = it->r;
					del(it->l, it->r, it->val);
					it = S.erase(it);
				}
				break;
			}
			if (it->r <= r) {
				del(it->l, it->r, it->val);
				it = S.erase(it);
			}
			else {
				if (it->val == val) {
					r = it->r;
					del(it->l, it->r, it->val);
					it = S.erase(it);
				}
				else {
					Node node = *it;
					del(it->l, it->r, it->val);
					it = S.erase(it);
					it = S.emplace_hint(it, r, node.r, node.val);
					add(it->l, it->r, it->val);
				}
			}
		}
		if (it != S.begin()) {
			it = move(it);
			if (it->r == l) {
				if (it->val == val) {
					l = it->l;
					del(it->l, it->r, it->val);
					it = S.erase(it);
				}
			}
			else if (l < it->r) {
				if (it->val == val) {
					l = min(l, it->l);
					r = max(r, it->r);
					del(it->l, it->r, it->val);
					it = S.erase(it);
				}
				else {
					if (r < it->r) {
						it = S.emplace_hint(next(it), r, it->r, it->val);
						add(it->l, it->r, it->val);
						it = move(it);
					}
					Node node = *it;
					del(it->l, it->r, it->val);
					it = S.erase(it);
					it = S.emplace_hint(it, node.l, l, node.val);
					add(it->l, it->r, it->val);
				}
			}
		}
		if (it != S.end()) it = next(it);
		it = S.emplace_hint(it, l, r, val);
		add(it->l, it->r, it->val);
	}
	void update(const T& l, const T& r, const VAL& val) {
		update(l, r, val, [](T, T, VAL) {}, [](T, T, VAL) {});
	}
	template<class ADDFUNC, class DELFUNC> void insert(T l, T r, const ADDFUNC& add, const DELFUNC& del) {
		update(l, r, VAL(), add, del);
	}
	void insert(const T& l, const T& r) {
		update(l, r, VAL(), [](T, T, VAL) {}, [](T, T, VAL) {});
	}

	// erase [l, r)
	// del: reflect effects of interval-delete
	// add: reflect effects of interval-add
	// add and del should be reversed operation each other
	template<class ADDFUNC, class DELFUNC> void erase(T l, T r, const ADDFUNC& add, const DELFUNC& del) {
		auto it = S.lower_bound(Node(l, 0, VAL()));
		//COUT(*it);
		while (it != S.end() && it->l <= r) {
			if (it->l == r) break;
			if (it->r <= r) {
				del(it->l, it->r, it->val);
				it = S.erase(it);
			}
			else {
				Node node = *it;
				del(it->l, it->r, it->val);
				it = S.erase(it);
				it = S.emplace_hint(it, r, node.r, node.val);
				add(it->l, it->r, it->val);
			}
		}
		if (it != S.begin()) {
			it = move(it);
			if (l < it->r) {
				if (r < it->r) {
					it = S.emplace_hint(next(it), r, it->r, it->val);
					add(it->l, it->r, it->val);
					it = move(it);
				}
				Node node = *it;
				//COUT(*it);
				del(it->l, it->r, it->val);
				it = S.erase(it);
				it = S.emplace_hint(it, node.l, l, node.val);
				add(it->l, it->r, it->val);
				//COUT(*it);
			}
		}
	}
	void erase(const T& l, const T& r) {
		erase(l, r, [](T, T, VAL) {}, [](T, T, VAL) {});
	}

	// debug
	friend ostream& operator << (ostream& s, const IntervalSet& ins) {
		for (auto e : ins.S) {
			s << "([" << e.l << ", " << e.r << "): " << e.val << ") ";
		}
		return s;
	}
};

template <class T>
void kMeans(						//kmeans法でクラスタリング
	const vector<pair<T, T>>& pts,	//座標
	vector<int>& cluster_id,		//クラスタ番号　予め適当に割り振る
	int K,							//クラスタ数
	int max_iterations = 100		//最大反復（繰り返し）回数 数百程度で十分
) {
	int N = pts.size();
	assert((int)cluster_id.size() == N);

	vector<pair<double, double>> centroid(K);
	vector<int> cnt(K);

	for (int iter = 0; iter < max_iterations; iter++) {
		// --- 重心計算 ---
		fill(centroid.begin(), centroid.end(), make_pair(0.0, 0.0));
		fill(cnt.begin(), cnt.end(), 0);

		for (int i = 0; i < N; i++) {
			int c = cluster_id[i];
			assert(0 <= c && c < K);
			centroid[c].first += pts[i].first;
			centroid[c].second += pts[i].second;
			cnt[c]++;
		}

		for (int k = 0; k < K; k++) {
			if (cnt[k] == 0) {
				// 空クラスタ → ランダム点を重心に
				int i = rand() % N;
				centroid[k] = {
					(double)pts[i].first,
					(double)pts[i].second
				};
			}
			else {
				centroid[k].first /= cnt[k];
				centroid[k].second /= cnt[k];
			}
		}

		// --- 再割当 ---
		bool changed = false;
		for (int i = 0; i < N; i++) {
			double best = 1e100;
			int best_k = -1;
			for (int k = 0; k < K; k++) {
				double dx = pts[i].first - centroid[k].first;
				double dy = pts[i].second - centroid[k].second;
				double d = dx * dx + dy * dy;
				if (d < best) {
					best = d;
					best_k = k;
				}
			}
			if (cluster_id[i] != best_k) {
				cluster_id[i] = best_k;
				changed = true;
			}
		}

		if (!changed) break;
	}
}
template <class T>
void kMeansWithSizes(						//kmeans法でクラスタリング クラスタサイズを指定できる
	const vector<pair<T, T>>& pts,			//座標
	vector<int>& cluster_id,				//クラスタ番号　予め割り振りたい数だけ割り振る
	int K,									//クラスタ数
	int max_iterations = 100				//最大反復（繰り返し）回数 数百程度で十分
) {
	int N = pts.size();
	assert((int)cluster_id.size() == N);

	vector<pair<double, double>> centroid(K);
	vector<int> cnt(K);

	for (int iter = 0; iter < max_iterations; iter++) {
		// --- 重心計算（そのまま） ---
		fill(centroid.begin(), centroid.end(), make_pair(0.0, 0.0));
		fill(cnt.begin(), cnt.end(), 0);

		for (int i = 0; i < N; i++) {
			int c = cluster_id[i];
			centroid[c].first += pts[i].first;
			centroid[c].second += pts[i].second;
			cnt[c]++;
		}
		for (int k = 0; k < K; k++) {
			centroid[k].first /= cnt[k];
			centroid[k].second /= cnt[k];
		}

		// --- サイズ不変 swap ---
		bool changed = false;
		for (int i = 0; i < N; i++) {
			for (int j = i + 1; j < N; j++) {
				int ci = cluster_id[i];
				int cj = cluster_id[j];
				if (ci == cj) continue;

				auto dist = [&](int p, int c) {
					double dx = pts[p].first - centroid[c].first;
					double dy = pts[p].second - centroid[c].second;
					return dx * dx + dy * dy;
				};

				double delta =
					dist(i, cj) + dist(j, ci)
					- dist(i, ci) - dist(j, cj);

				if (delta < 0) {
					swap(cluster_id[i], cluster_id[j]);
					changed = true;
				}
			}
		}

		if (!changed) break;
	}
}
template<class T>
vector<pii> mst_points(const vector<pair<T, T>>& p) {	//最小全域木 
	int N = p.size();
	const long long INF = (1LL << 62);

	vector<long long> dist(N, INF);
	vector<int> parent(N, -1);
	vector<bool> used(N, false);

	dist[0] = 0;

	for (int it = 0; it < N; it++) {
		int v = -1;
		for (int i = 0; i < N; i++) {
			if (!used[i] && (v == -1 || dist[i] < dist[v])) v = i;
		}
		used[v] = true;

		for (int u = 0; u < N; u++) {
			if (used[u]) continue;
			long long dx = p[v].first - p[u].first;
			long long dy = p[v].second - p[u].second;
			long long w = dx * dx + dy * dy;
			if (w < dist[u]) {
				dist[u] = w;
				parent[u] = v;
			}
		}
	}

	vector<pii> res;
	for (int i = 1; i < N; i++) {
		res.push_back({ parent[i], i });
	}
	return res;
}


#ifdef HEURISTIC
namespace heuristic {
	struct BIT_FIELD {
		const int AREA_H = 10;
		const int AREA_W = 10;
		bitset<100> allocated_blocks;
		bitset<100> LEFT_EDGE;
		bitset<100> RIGHT_EDGE;

		void init_mask() {
			rep(i, 0, 10) {
				LEFT_EDGE.set(i * 10 + 0);
				RIGHT_EDGE.set(i * 10 + 9);
			}
		}
		void set(int x, int y) {
			allocated_blocks.set(x * AREA_W + y);
		}
		void reset(int x, int y) {
			allocated_blocks.reset(x * AREA_W + y);
		}
		void bit_shift_h(int n) {
			if (n > 0) {
				allocated_blocks = allocated_blocks << n * AREA_W;
			}
			else {
				allocated_blocks = allocated_blocks >> -n * AREA_W;
			}
		}
		void bit_shift_w(int n) {
			if (n > 0) {
				rep(i, 0, n) {
					allocated_blocks &= ~RIGHT_EDGE;
					allocated_blocks <<= 1;
				}

			}
			else {
				rep(i, 0, n) {
					allocated_blocks &= ~LEFT_EDGE;
					allocated_blocks >>= 1;
				}
			}
		}
		void bit_shift_hw(int h, int w) {
			bit_shift_h(h);
			bit_shift_w(w);
		}

		void print() {

			rep(i, 0, AREA_H) {
				rep(j, 0, AREA_W) {
					cout << allocated_blocks[i * AREA_W + j];
				}
				cout << el;
			}
		}
	};
	class IndexedSet {
	public:
		IndexedSet(int N) {
			index.assign(N, -1);
		}

		bool add(int a) {
			if (index[a] != -1) return false;

			index[a] = arr.size();
			arr.push_back(a);
			return true;
		}
		bool remove(int a) {
			if (index[a] == -1) return false;

			int pos = index[a];
			int last = arr.back();

			arr[pos] = last;
			index[last] = pos;

			arr.pop_back();
			index[a] = -1;
			return true;
		}
		bool contains(int a) const {
			return index[a] != -1;
		}

		int position(int a) const {
			return index[a];
		}

		int operator[](int i) const {
			return arr[i];
		}

		int size() const {
			return arr.size();
		}

	private:
		vector<int> arr;    // 実体（順序付き）
		vector<int> index;  // 値 → arr 内の位置
	};
	template<class T>
	bool temperature(
		double& turn,
		double& turn_max,
		T& old_score,
		T& new_score,
		double start_temp = 30.0,
		double end_temp = 2.0,
		bool is_minimizing = true// trueなら小さい方が良い
	) {
		double temp = start_temp + (end_temp - start_temp) * turn / turn_max;
		T score_diff = is_minimizing ? new_score - old_score : old_score - new_score;

		if (score_diff <= 0) return true;
		double probability = exp(-score_diff / temp);
		return random_real_0_1() < probability;
	}


	/*
	BURNクラス：焼きなまし法を行う
	*/
	template<class State, class Task, class Prob>
	class BURN {
	public:
		BURN(State& s, Task task, Prob prob, double tl = 1.95)
			: state(s), task(task), prob(prob), timeLimit(tl) {
		}
		double time;
		void run() {
			TIMER timer;
			ll loop = 0, adopt = 0;

			while ((time = timer.count()) < timeLimit) {
				if (task(state, time, timeLimit)) {
					adopt++;
				}
				loop++;
			}
			cerr << "loop=" << loop << " adopt=" << adopt << el;
		}

	private:
		State& state;
		Task task;
		Prob prob;
		double timeLimit;
	};
	//温度関数

	inline bool probability(double old_score, double new_score,
		double now, double limit) {
		return temperature(
			now, limit,
			old_score, new_score,
			30.0, 2.0,
			false	//小さいほうが良いスコアならtrue
		);
	};
	//焼きなまし法における現状態の管理を行う
	struct Annealing {
		int score_ = 0;

		void input() {

		}

		void make_first() {

		}

		int cale_score_all() {
			score_ = 0;
			return score_;
		}
		int cale_score() {
			int score = 0;
			return score;
		}
		void print() {

		}
		//bool operator<(const Annealing& other) const {
		//	return score_ < other.score_;
		//}
	};



	//焼きなまし法の1ループで行うこと
	bool task1(Annealing& s, double& time, double& timeLimit) {

		int new_score = 0;
		if (!probability(s.score_, new_score, time, timeLimit)) {

			return false;
		}

		return true;

	}
	bool task(Annealing& s, double& time, double& timeLimit) {

		return task1(s, time, timeLimit);

	};
	void solve_burn() {

		Annealing state;
		state.input();
		state.make_first();
		state.cale_score_all();
		BURN burn(
			state,
			task,
			probability,
			1.95
		);

		burn.run();
		state.print();
	}

	// 行動を復元する永続stack
	//https://jetbead.github.io/AtCoderHeuristicContestMemo/Library/persistent_stack.html
	template <class T>
	class PersistentStack {
	public:
		struct History {
			T v;
			shared_ptr<History> parent;
			History(const T& v, shared_ptr<History> parent) : v(v), parent(parent) {}
		};

		PersistentStack() : head(nullptr) {}
		PersistentStack(shared_ptr<History> head) : head(head) {}
		bool empty() const {
			return head == nullptr;
		}
		T top() {
			return head->v;
		}
		PersistentStack push(const T& v) {
			return PersistentStack(make_shared<History>(v, head));
		}
		PersistentStack pop() {
			return PersistentStack(head->parent);
		}

	private:
		shared_ptr<History> head;
	};

	struct Beam {
		using ACTION = int;
		/*TODO:スコアが小さいほど良いかどうかを確認する*/
		bool LOWER_IS_BETTER = true;
		const int BEAM_WIDTH = 700;
		const int BEAM_TURN = 1000;	//必要ターン数見積もり(初期状態も含まれることに注意)

		//スコアが小さいほうが良いか?
		inline bool better(int a, int b) {
			if (LOWER_IS_BETTER) {
				return a < b;
			}
			else {
				return a > b;
			}
		}
		// スコアだけ計算して上位を選ぶために用いる仮ノード
		struct TemporaryNode {
			int score;
			uint64_t hash;
			int node_index;
			ACTION actions_;
			double rand; // タイブレーク用

			TemporaryNode(int score, uint64_t hash, int node_index, ACTION& actions_) :
				score(score), hash(hash), node_index(node_index), actions_(actions_) {
				rand = random_real_0_1();
			}
		};

		struct State {
			int score_;

			PersistentStack<ACTION> stack;// どの行動で来たか


			uint64_t hash_;

			State() {

			}

			bool isDone() const {
				return false;
			}

			void advance(const ACTION& action) {
				// 状態更新
				// score_ もここで更新

			}
			pair<int, uint64_t> try_move(const ACTION& action) const {
				//点数とハッシュを返す
				return { 0,0 };
			}
			vector<ACTION> legalActions() const {
				vector<ACTION> act;


				return act;
			}

			//bool operator<(const State& other) const {		//未使用
			//	return score_ > other.score_; // 降順
			//}
		};

		State make_first() {
			State state;
			return state;
		}

		void task() {

			TIMER timer;
			vector<State> cur, next;

			cur.reserve(BEAM_WIDTH);
			next.reserve(BEAM_WIDTH);
			vector<TemporaryNode> temp_nodes;
			temp_nodes.reserve(BEAM_WIDTH * 100);
			unordered_map<uint64_t, int> mp_index;

			cur.push_back(make_first());
			for (int turn = 0; turn < BEAM_TURN; turn++) {


				temp_nodes.clear();
				mp_index.clear();
				// --- 展開 ---
				rep(i, 0, cur.size()) {
					auto& st = cur[i];
					auto actions = st.legalActions();
					for (auto action : actions) {
						auto [next_score, next_hash] = st.try_move(action);
						if (mp_index.count(next_hash)) {
							int idx = mp_index[next_hash];

							// 既存より良いなら更新
							if (better(next_score, temp_nodes[idx].score)) {
								temp_nodes[idx] = { next_score, next_hash, (int)i, action };
							}
						}
						else {
							mp_index[next_hash] = temp_nodes.size();
							temp_nodes.emplace_back(next_score, next_hash, i, action);
						}
					}
				}


				// --- 上位K件 ---

				int node_size = temp_nodes.size();
				// 候補がビーム幅より多いなら上位beam_width個を選ぶ
				if (node_size > BEAM_WIDTH) {
					nth_element(temp_nodes.begin(), temp_nodes.begin() + BEAM_WIDTH, temp_nodes.end(),
						[this](TemporaryNode& n1, TemporaryNode& n2) {
						if (n1.score == n2.score) {
							return n1.rand < n2.rand;
						}
						/*	TODO：scoreが大きいほど良いのか、小さいほど良いのか確認 */
						return better(n1.score, n2.score);
					});
				}
				for (int i = 0; i < min(BEAM_WIDTH, node_size); i++) {
					int index = temp_nodes[i].node_index;
					next.emplace_back(cur[index]);
					next.back().advance(temp_nodes[i].actions_);
					next.back().stack = next.back().stack.push(temp_nodes[i].actions_);
					// 必要ならスコアとハッシュ値を確認
					assert(next.back().score_ == temp_nodes[i].score);
					assert(next.back().hash_ == temp_nodes[i].hash);
				}
				// --- 終了判定 ---
				vector<int> doned_index;
				for (int i = 0; i < next.size(); i++) {
					if (next[i].isDone()) {
						// 復元してreturn
						if (next[i].isDone()) {
							// 復元してreturn
							doned_index.push_back(i);

						}
						vector<ACTION> ans;
						while (!next[i].stack.empty()) {
							ans.push_back(next[i].stack.top());
							next[i].stack = next[i].stack.pop();
						}
						reverse(ans.begin(), ans.end());


						return;
					}
				}
				if (!doned_index.empty()) {
					auto ite = min_element(doned_index.begin(), doned_index.end(), [&](int& n1, int& n2) {
						return better(next[n1].score_, next[n2].score_);
					});

					int i = *ite;
					vector<ACTION> ans;
					while (!next[i].stack.empty()) {
						ans.push_back(next[i].stack.top());
						next[i].stack = next[i].stack.pop();
					}
					reverse(ans.begin(), ans.end());
					//出力
					rep(j, 0, ans.size()) {

					}
					return;
				}
				// --- 入れ替え ---
				swap(cur, next);
				next.clear();
			}

		}
	};
}

using namespace heuristic;
#endif
//struct LINE {
//	/*
//		ax + by + c = 0の直線
//	
//	*/
//
//	ll a;
//	ll b;
//	ll c;
//	friend auto operator<=>(const LINE&, const LINE&) = default;
//	LINE(ll A, ll B, ll C) {
//		a = A; b = B; c = C;
//		normalization();
//	}
//	LINE(ll px, ll py, ll qx, ll qy) {
//		a = qy - py;
//		b = px - qx;
//		c = qx * py - px * qy;
//
//		normalization();
//	}
//	//表現の正規化 　以下をすることで同じ直線が一意に表現される
//	void normalization(){
//		//全部の最大公約数で割る
//		ll g = gcd(a, gcd(b, c));
//		a /= g, b /= g, c /= g;
//		//傾きを正の向きに直す
//		if (a < 0) a = -a, b = -b, c = -c;
//		//傾き0なら、bを正にする
//		if (a == 0 and b < 0) b = -b, c = -c;
//	}
//	//点が線上にある
//	bool contains(ll x, ll y) const {
//		return a * x + b * y + c == 0;
//	}
//	//点が上側or下側
//	ll eval(ll x, ll y) const {
//		return a * x + b * y + c;
//	}
//
//	//平行の関係
//	bool is_parallel(const LINE& rhs) const {
//		return a * rhs.b == b * rhs.a;
//	}
//	//同じ
//	bool is_same(const LINE& rhs) const {
//		return *this == rhs;
//	}
//	//垂直
//	bool is_vertical(const LINE& rhs) const {
//		return a * rhs.a + b * rhs.b == 0;
//	}
//	//向きベクトル
//	pair<ll, ll> direction() const {
//		return { -b,a };
//	}
//	// 法線ベクトル
//	pair<ll, ll> normal() const {
//		return { a,b };
//	}
//};
////垂直二等分線を得る
//LINE get_canonical(ll px, ll py, ll qx, ll qy) {
//	
//	long long a = 2 * (qx - px);
//	long long b = 2 * (qy - py);
//	long long c = px * px + py * py - qx * qx - qy * qy;
//	LINE l(a,b,c);
//	return l;
//}

int main() {
	int N, K; cin >> N >> K;
	if (K == 0) {
		cout << -1 << el; return 0;
	}
	vector<vector<int>> ans(N, vector<int>(N, -1));

	set<int> remain_mn,remain_mx;
	rep(i, 0, N*N-K)remain_mn.insert(i+1);
	rep(i, N * N - K, N*N)remain_mx.insert(i + 1);
	//cerr << remain_mn << el;
	//cerr << remain_mx << el;
	rep(i, 0, N)rep(j, 0, N) {
		if (i * N + j < K) {
			ans[i][j] = *remain_mx.begin();
			remain_mx.erase(ans[i][j]);
		}
		else {
			ans[i][j] = *remain_mn.rbegin();
			remain_mn.erase(ans[i][j]);
		}

	}
	rep(i, 0, N)cout << ans[i] << el;
	return 0;
}