#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;
const int MAXN = 500100, MAXK = 30;
//const ll MOD = 998244353;
const ll INF = 1e17;
const ld PI = asin(1) * 2;
int n, r;
vi seq;
int seq2[MAXN];
int x;
int a[MAXN], b[MAXN];
int check (int st) {
//cout << " Check st = " << st << endl;
st--;
FOR(i, 0, 2*n-1){
if (i/2 < st)
seq2[i] = seq[i];
else if (i/2 == st && (i%2 == 0))
seq2[i] = x;
else
seq2[i] = seq[i-1];
}
FOR(t, 0, n-1) {
a[t] = seq2[2*t];
b[t] = seq2[2*t+1];
}
// cout << " before Swap" << endl;
// FOR(t, 0, n-1)
// cout << " t = " << t << " a = " << a[t] << " b = " << b[t] << endl;
REP(2*n) {
FOR(i, 0, n-1) {
if (i == 0 && a[i] > b[i]) swap(a[i], b[i]);
else if (i > 0 && a[i] < b[i]) swap(a[i], b[i]);
}
FOR(i, 0, n-2)
swap(b[i],b[i+1]);
// cout << " after Swap" << endl;
// FOR(t, 0, n-1)
// cout << " t = " << t << " a = " << a[t] << " b = " << b[t] << endl;
}
int curT = 0;
FOR(t, 0, n-1) {
if (a[t] == x) return t;
if (b[t] == x) curT = t;
//cout << " t = " << t << " a = " << a[t] << " b = " << b[t] << endl;
}
curT = (curT - ((r-2*n)%n) + n)%n;
return curT;
}
int main()
{
FAST_IO;
cin >> n >> r >> x;
REP(2*n-1) {
int p; cin >> p;
seq.pb(p);
}
if (x == 1) {
cout << n << "\n";
return 0;
}
int ans = 1, mnTarget = n+1;
FOR(i, 1, n) {
int e = check(i);
if (e <= mnTarget) {
ans = i;
mnTarget = e;
}
}
cout << ans << "\n";
return 0;
}
