#include "prison.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;
int kth_digit(int x, int b, int k) {
while(k--) x /= b;
return x % b;
}
vector<vector<int>> devise_strategy(int N) {
int x = 7 * 4 + 3;
vector<vector<int>> res(x + 1);
For(i, 0, x) {
int k = i / 4;
int t = i % 4;
if(t == 0) res[i].eb(0);
else res[i].eb(1);
For(num, 1, N) {
int dig = kth_digit(num, 3, 7 - k);
if(t == 0) {
res[i].eb(i + 1 + dig);
} else if(dig != t - 1) {
if(t - 1 < dig) res[i].eb(-1);
else res[i].eb(-2);
} else {
if((k + 1) * 4 <= x) res[i].eb((k + 1) * 4);
else res[i].eb(0);
}
}
}
return res;
}
/*
3
1 2
1 3
2 1
2 3
3 1
3 2
-1
A
A
B
A
B
B
*/
