itmo_N3

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

bool ok(vector <int> v) {
    return v[5] < v[3]
    &&
    v[3] < v[0]
    &&
    v[0] < v[6]
    &&
    v[6] < v[4]
    &&
    v[3] < v[2]
    &&
    v[2] < v[8]
    &&
    v[8] < v[4]
    &&
    v[5] < v[1]
    &&
    v[1] < v[9]
    &&
    v[9] < v[7]
    &&
    v[0] < v[7]
    &&
    v[7] < v[2]
    &&
    v[9] < v[8]
    &&
    v[5] < v[9]
    &&
    v[6] < v[1];
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    vector <int> a = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
    reverse(a.begin(), a.end());
    do {
        vector <int> v(10);
        for (int i = 0; i <= 9; ++i) {
            for (int j = 0; j <= 9; ++j) {
                if (a[j] == i) {
                    v[i] = j;
                }
            }
        }
        cv(a);
        cv(v);
        if (ok(v)) {
            cout << "OK\n";
            break;
        }
    } while (next_permutation(a.begin(), a.end()));
}