#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "plants.h"
namespace TEST2 {
VI a;
void init(int k, VI r) {
int n = r.size();
a = VI(n);
int mx = n-1;
while (mx >= 0) {
bool worked = false;
rep(i, n) {
if (r[i] == 0) {
bool canbe = true;
int ii = i-1;
rep(j, k-1) {
if (ii == -1) ii = n-1;
if (r[ii--] == 0) {
canbe = false;
break;
}
}
if (!canbe) continue;
worked = true;
a[i] = mx--;
rep(j, k) {
if (i == -1) i = n-1;
r[i--]--;
}
break;
}
}
assert(worked);
}
/*for (int x : a) cout << x << " "; cout << endl;*/
}
int compare_plants(int x, int y) {
if (a[x] > a[y]) return +1;
if (a[x] < a[y]) return -1;
return 0;
}
};
bool test2;
VI pref;
void init(int k, VI r) {
int n = r.size();
test2 = (2 * k > n);
if (test2) TEST2::init(k, r);
else {
pref = VI(n+1);
rep(i, n) pref[i+1] = pref[i] + r[i];
}
}
int compare_plants(int x, int y) {
if (test2) return TEST2::compare_plants(x, y);
if (pref[y] - pref[x] == 0) return +1;
if (pref[y] - pref[x] == y - x) return -1;
return 0;
}
