(x.fi - y.fi, x.se - y.se); }\ntemplate pair operator+(const pair &x, const pair &y) { return pair(x.fi + y.fi, x.se + y.se); }\ntemplate pair operator&(const pair &l, const pair &r) { return pair(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate pair operator+=(pair &l, const pair &r) { return l = l + r; }\ntemplate pair operator-=(pair &l, const pair &r) { return l = l - r; }\ntemplate bool intersect(const pair &l, const pair &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate ll operator*(const pair &x, const pair &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }\n\ntemplate struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n constexpr bool operator<(const edge &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate using Edges = vector>;\n\nusing Tree = vector>;\nusing Graph = vector>;\ntemplate using Wgraph = vector>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return res;\n}\ntemplate Wgraph getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate void add(Wgraph &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate ostream &operator<<(ostream &os, const vector &v) {\n for(auto it = begin(v); it != end(v); ++it) {\n if(it == begin(v))\n os << *it;\n else\n os << \" \" << *it;\n }\n return os;\n}\ntemplate ostream &operator<<(ostream &os, const pair &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate string to_string(pair p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\nstring to_string(string s) { return \"\\\"\" + s + \"\\\"\"; }\nstring to_string(char c) { return string(1, c); }\ntemplate string to_string(vector s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it) + (next(it) == s.end() ? \"\" : \", \");\n return res + \"}\";\n}\ntemplate string to_string(set s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it), res += (next(it) == end(s) ? \"\" : \", \");\n return res + \"}\";\n}\n\n#define endl '\\n'\n\n#ifdef _LOCAL\nvoid dump() { cerr << endl; }\ntemplate void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\nvoid dump() {}\ntemplate void dump(Head head, Tail... tail) {}\n#define debug(x)\n#endif\ntemplate void print(const T &a) { cout << a; }\nvoid OUT() { cout << endl; }\ntemplate void OUT(const Head &head, const Tail &...tail) {\n print(head);\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate static constexpr T inf = numeric_limits::max() / 2;\n#define drop(s) cout << #s << endl, exit(0)\n\ntemplate struct ndFORarray {\n std::array v;\n ndFORarray(std::array v_) : v(v_) {}\n struct ndFORitr {\n const std::array &v;\n std::array tmp;\n bool is_end;\n ndFORitr(const std::array &v_) : v(v_), tmp(), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = N - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::array &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nstruct ndFORvector {\n std::vector v;\n ndFORvector(std::vector v_) : v(v_) {}\n struct ndFORitr {\n const std::vector &v;\n std::vector tmp;\n bool is_end;\n ndFORitr(const std::vector &v_) : v(v_), tmp(v.size(), 0), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = v.size() - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::vector &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nauto ndFOR(std::vector v) { return ndFORvector(v); }\ntemplate auto ndFOR(Ts... v) { return ndFORarray>::value>({v...}); }\ntemplate struct REC {\n F f;\n REC(F &&f_) : f(std::forward(f_)) {}\n template auto operator()(Args &&...args) const { return f(*this, std::forward(args)...); }\n};\n\ntemplate vector> runLength(const vector &v) {\n vector> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector> runLength(const string &v) {\n vector> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\ntemplate struct Imos {\n int n;\n vector a;\n Imos(int _n) : n(_n), a(_n + 1) {}\n void add(int l, int r, T val = 1) {\n if(l >= r) return;\n l = clamp(l, 0, n);\n r = clamp(r, 0, n + 1);\n a[l] += val;\n if(r <= n) a[r] -= val;\n }\n void build() {\n for(int i = 0; i < n; i++) a[i + 1] += a[i];\n }\n const T &operator[](int k) { return a[k]; }\n};\n\ntemplate struct RUI {\n vector a;\n RUI(const vector &v) : a(v.size() + 1) {\n for(int i = 0; i < v.size(); i++) a[i + 1] = a[i] + v[i];\n }\n T get(int l, int r) { return a[r] - a[l]; }\n};\n\ntemplate T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\n#pragma endregion\n\nint main() {\n while(1) {\n INT(n, m, r);\n if(!n) exit(0);\n VEC(int, a, n);\n VEC(int, b, m);\n rep(i, n) a[i]--;\n rep(i, m) b[i]--;\n\n struct S {\n vi v;\n vvc match;\n S(vi a) : v(a) { match = vvc(si(a) + 1, vi(si(a) + 1)); }\n S() = default;\n };\n\n vector A, B;\n rep(i, n) {\n A.eb(a);\n rotate(begin(a), begin(a) + 1, end(a));\n }\n rep(i, m) {\n B.eb(b);\n rotate(begin(b), begin(b) + 1, end(b));\n }\n\n vector> R;\n rep(i, r) {\n INT(k);\n VEC(int, x, k);\n rep(i, k) x[i]--;\n INT(y);\n y--;\n R.eb(y, x);\n }\n\n vv(int, DP, 30, 30);\n auto calc = [&](S &s) {\n auto &dp = s.match;\n int n = si(s.v);\n rep2(d, 1, n) {\n rep(i, n) {\n int j = i + d;\n if(j > n) break;\n if(d == 1) {\n dp[i][j] = 1 << s.v[i];\n continue;\n }\n for(auto &[y, x] : R) {\n if(dp[i][j] >> y & 1) continue;\n int k = si(x);\n rep(i, d + 1) rep(j, k + 1) DP[i][j] = 0;\n DP[0][0] = 1;\n rep(ii, d) rep(jj, k) {\n if(!DP[ii][jj]) continue;\n rep2(to, ii + 1, d) {\n int l = i + ii;\n int r = i + to;\n if(dp[l][r] >> x[jj] & 1) DP[to][jj + 1] = true;\n }\n }\n if(DP[d][k]) dp[i][j] |= 1 << y;\n }\n }\n }\n };\n each(e, A) calc(e);\n each(e, B) calc(e);\n\n int ma = -1;\n each(a, A) each(b, B) {\n rep(i, n + 1) rep(j, m + 1) DP[i][j] = -inf;\n DP[0][0] = 0;\n auto &x = a.match, &y = b.match;\n rep(i, n) rep(j, m) {\n if(DP[i][j] < 0) continue;\n rep2(ii, i + 1, n) rep2(jj, j + 1, m) {\n if(x[i][ii] & y[j][jj]) chmax(DP[ii][jj], DP[i][j] + 1);\n }\n }\n chmax(ma, DP[n][m]);\n }\n OUT(ma);\n }\n}","accuracy":1,"time_ms":390,"memory_kb":3596,"score_of_the_acc":-0.0352,"final_rank":1},{"submission_id":"aoj_1191_6029771","code_snippet":"#pragma region Macros\n#pragma comment(linker, \"/stack:200000000\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#include \n#define ll long long\nusing ld = long double;\n#define rep2(i, a, b) for(ll i = (a); i <= (b); i++)\n#define rep3(i, a, b) for(ll i = (a); i >= (b); --i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define each(i, a) for(auto &&i : a)\n#define pii pair\n#define pll pair\n#define pb push_back\n#define eb emplace_back\n#define vi vector\n#define vll vector\n#define vpi vector\n#define vpll vector\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define vv(type, name, h, ...) vector> name(h, vector(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector> name(h, vector(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector>> name(h, vector>(w, vector(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector>>> name(a, vector>>(b, vector>(c, vector(__VA_ARGS__))))\n#define mt make_tuple\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\ntemplate T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\ntemplate using vc = vector;\ntemplate using vvc = vector>;\ntemplate using vvvc = vector>;\ntemplate using vvvvc = vector>;\ntemplate using pq = priority_queue;\ntemplate using pqg = priority_queue, greater>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS__)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate void scan(pair &p) { scan(p.first), scan(p.second); }\ntemplate void scan(vector &);\ntemplate void scan(vector &a) {\n for(auto &i : a) scan(i);\n}\ntemplate void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate void IN(Head &head, Tail &...tail) {\n scan(head);\n IN(tail...);\n}\n\ntemplate inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\ntemplate vi iota(vector &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n\ntemplate T ceil(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate T floor(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? x / y : (x + y - 1) / y);\n}\ntemplate T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\ntemplate T POW(T x, S n, const ll &mod) {\n T res = 1;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\n return res;\n}\nvector factor(ll x) {\n vector ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate vector divisor(T x) {\n vector ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate void zip(vector &x) {\n vector y = x;\n UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate void fold_in(vector &v) {}\ntemplate void fold_in(vector &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate void renumber(vector &v) {}\ntemplate void renumber(vector &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate vector zip(vector &head, Args &&...args) {\n vector v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\n\n// x in [l, r)\ntemplate bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n// (a, b) in [lx, rx) * [ly, ry)\ntemplate bool inc(const pair &x, const S &lx, const S &ly, const S &rx, const S &ry) { return inc(x.fi, lx, rx) && inc(x.se, ly, ry); }\n\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll allbit(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef _LOCAL\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate void random_shuffle(vc &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate pair operator-(const pair &x, const pair &y) { return pair(x.fi - y.fi, x.se - y.se); }\ntemplate pair operator+(const pair &x, const pair &y) { return pair(x.fi + y.fi, x.se + y.se); }\ntemplate pair operator&(const pair &l, const pair &r) { return pair(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate pair operator+=(pair &l, const pair &r) { return l = l + r; }\ntemplate pair operator-=(pair &l, const pair &r) { return l = l - r; }\ntemplate bool intersect(const pair &l, const pair &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate ll operator*(const pair &x, const pair &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }\n\ntemplate struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n constexpr bool operator<(const edge &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate using Edges = vector>;\n\nusing Tree = vector>;\nusing Graph = vector>;\ntemplate using Wgraph = vector>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return res;\n}\ntemplate Wgraph getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate void add(Wgraph &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate ostream &operator<<(ostream &os, const vector &v) {\n for(auto it = begin(v); it != end(v); ++it) {\n if(it == begin(v))\n os << *it;\n else\n os << \" \" << *it;\n }\n return os;\n}\ntemplate ostream &operator<<(ostream &os, const pair &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate string to_string(pair p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\nstring to_string(string s) { return \"\\\"\" + s + \"\\\"\"; }\nstring to_string(char c) { return string(1, c); }\ntemplate string to_string(vector s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it) + (next(it) == s.end() ? \"\" : \", \");\n return res + \"}\";\n}\ntemplate string to_string(set s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it), res += (next(it) == end(s) ? \"\" : \", \");\n return res + \"}\";\n}\n\n#define endl '\\n'\n\n#ifdef _LOCAL\nvoid dump() { cerr << endl; }\ntemplate void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\nvoid dump() {}\ntemplate void dump(Head head, Tail... tail) {}\n#define debug(x)\n#endif\ntemplate void print(const T &a) { cout << a; }\nvoid OUT() { cout << endl; }\ntemplate void OUT(const Head &head, const Tail &...tail) {\n print(head);\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate static constexpr T inf = numeric_limits::max() / 2;\n#define drop(s) cout << #s << endl, exit(0)\n\ntemplate struct ndFORarray {\n std::array v;\n ndFORarray(std::array v_) : v(v_) {}\n struct ndFORitr {\n const std::array &v;\n std::array tmp;\n bool is_end;\n ndFORitr(const std::array &v_) : v(v_), tmp(), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = N - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::array &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nstruct ndFORvector {\n std::vector v;\n ndFORvector(std::vector v_) : v(v_) {}\n struct ndFORitr {\n const std::vector &v;\n std::vector tmp;\n bool is_end;\n ndFORitr(const std::vector &v_) : v(v_), tmp(v.size(), 0), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = v.size() - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::vector &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nauto ndFOR(std::vector v) { return ndFORvector(v); }\ntemplate auto ndFOR(Ts... v) { return ndFORarray>::value>({v...}); }\ntemplate struct REC {\n F f;\n REC(F &&f_) : f(std::forward(f_)) {}\n template auto operator()(Args &&...args) const { return f(*this, std::forward(args)...); }\n};\n\ntemplate vector> runLength(const vector &v) {\n vector> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector