Problem 5

#include <bits/stdc++.h>
using namespace std;
#define int int64_t

int n, m;
vector<vector<int>> A;

void init() {
    A.assign(n, vector<int>(m));
}

pair<int, int> solve(int k) {
    int i = 0, j = m - 1;
    while (i < n && j > -1) {
        if (A[i][j] == k) return make_pair(i, j);
        if (A[i][j] < k) ++i;
        else --j;
    }
    return make_pair(-1, -1);
}

signed main() {
    cin >> n >> m, init();
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            cin >> A[i][j];
    int k; cin >> k;
    auto ans = solve(k);
    cout << ans.first << ' ' << ans.second << endl;
}