#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define pb push_back
#define ppb pop_back
#define fr first
#define sc second
#define all(v) v.begin(), v.end()
#define vektor vector
#define ordered_set tree<pair <ll, ll>, null_type, less<pair <ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
constexpr ull Mod = 1e9 + 7;
constexpr ull sqr = 708;
constexpr ld EPS = 1e-12L;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll random(ll l, ll r) {if (l > r) return -1; return uniform_int_distribution<ll>(l, r)(rng);}
#include "grader.h"
int a[100][100], mark[100];
map <vector <int>, int> check;
// int language(int L){return random(0, 55);}
void excerpt(int E[100]){
vector <int> e;
for(int i = 0; i < 100; i ++) e.pb(E[i]);
sort(all(e));
int num = 0;
mark[0] = 1;
while(mark[num]) num = random(0, 55);
int ans = language(num);
mark[ans] = 1;
check[e] = ans;
}
