//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
#include "robots.h"
struct dsu {
    vector<int> p;
    vector<int> cnt;
    void init(int n, int k) {
        p.assign(n, {});
        cnt.assign(n, k);
        for (int i = 0; i < n; ++i) {
            p[i] = i;
        }
    }
    int getv(int v) {
        if (v == p.size())
            return v;
        if (p[v] == v)
            return v;
        return p[v] = getv(p[v]);
    }
    bool op(int v) {
        v = getv(v);
        if (v == p.size())
            return 0;
        cnt[v]--;
        if (cnt[v] == 0)
            p[v] = v + 1;
        return 1;
    }
};
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    vector<int> a;
    vector<int> b;
    for (int i = 0; i < A; ++i) {
        a.push_back(X[i]);
    }
    for (int i = 0; i < B; ++i) {
        b.push_back(Y[i]);
    }
    sort(all(a));
    sort(all(b));
    vector<pair<int, int>> prpr;
    for (int i = 0; i < T; ++i) {
        W[i] = upper_bound(all(a), W[i]) - a.begin();
        S[i] = upper_bound(all(b), S[i]) - b.begin();
        prpr.push_back({W[i], S[i]});
    }
    sort(all(prpr));
    reverse(all(prpr));
    int l = 0, r = T + 2;
    while (l + 1 < r) {
        int m = l + r >> 1;
        bool gd = 1;
        dsu usdx, usdy;
        usdx.init(a.size(), m);
        usdy.init(b.size(), m);
        for (auto [x, y] : prpr) {
            if (usdy.op(y) == 0) {
                if (usdx.op(x) == 0) {
                    gd = 0;
                    break;
                }
            }
        }
        if (gd) {
            r = m;
        } else {
            l = m;
        }
    }
    if (r > T) {
        return -1;
    }
    return r;
}
/*
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;
    cin >> t;

}
*/