/**
* In the name of Allah
* We are nothing and you're everything
**/
#include <bits/stdc++.h>
#include "prison.h"
using namespace std;
using ll = long long;
using ull = uint64_t;
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
//#define int long long
const char nl = '\n';
//const int N = 2e5+1;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9+7;
std::vector<std::vector<int>> devise_strategy(int N) {
vector<vector<int>> ans(N+1, vector<int> (N+1));
for (int i = 1; i <= N; ++i)ans[0][i] = i;
ans[0][1] = -1;
for (int i = 1; i <= N; ++i) {
ans[i][0] = 1;
for (int j = 1; j <= N; ++j) {
if (j < i)ans[i][j] = -2;
else ans[i][j] = -1;
}
}
return ans;
}
