/*************************************
* author: marvinthang *
* created: 29.06.2023 15:49:29 *
*************************************/
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
int N;
vector <vector <bool>> visited;
void init(int k, vector <int> r) {
N = r.size();
--k;
vector <vector <int>> adj(N);
REP(v, N) {
REP(i, N) if (!r[i]) {
bool ok = true;
REP(j, k) if (!r[(i - j - 1 + N) % N]) {
ok = false;
break;
}
if (ok) {
REP(j, k) {
int x = (i - j - 1 + N) % N;
--r[x];
if (r[x] >= 0) adj[x].push_back(i);
x = (i + j + 1) % N;
if (r[x] >= 0) adj[x].push_back(i);
}
r[i] = -1;
break;
}
}
}
visited.resize(N, vector<bool>(N));
REP(i, N) {
queue <int> q;
q.push(i);
visited[i][i] = 1;
while (!q.empty()) {
int u = q.front(); q.pop();
for (int v: adj[u]) if (!visited[i][v]) {
visited[i][v] = 1;
q.push(v);
}
}
}
}
int compare_plants(int x, int y) {
if (visited[x][y]) return -1;
if (visited[y][x]) return 1;
return 0;
}
