#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <math.h>
#include <cmath>
#include <string>
#include <time.h>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <string.h>
#include <stack>
using namespace std;
//
#define fast cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);cout.sync_with_stdio(0);
#define cin in
#define cout out
#define pii pair<int,int>
#define ll long long
#define db double
#define ld long double
#define uset unordered_set
#define umap unordered_map
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll,ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pnn pair<Node*, Node*>
#define uid uniform_int_distribution

ifstream in("input.txt");
ofstream out("output.txt");

//куда ведёт парсоч влево
vector<int> m;
vector<bool> used;
vector<vector<int>> g;

bool try_kuhn(int v) {
    if (used[v]) return 0;
    used[v] = 1;

    for (int to : g[v]) {
        if (m[to] == -1 || try_kuhn(m[to])) {
            m[to] = v;
            return 1;
        }
    }

    return 0;
}

void

int main() {

}