#include "bits/stdc++.h"
#define ff first
#define ss second
#define pp pop_back
#define ll long long
#define pb push_back
#define pq priority_queue
#define ls(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mnpq(asd) asd,vector<asd>,greater<asd>
#define fe(a,b,i) for(int i = a;i<=b;++i)
#define ef(a,b,i) for(int i = a;i>=b;--i)
#define pii pair<int,int>
#define wr cout << "------------------------" << endl
using namespace std;
const int N = 5005;
int p[N];
signed main(){
ios::sync_with_stdio(false);cin.tie(nullptr);
int n,q,m;
cin >> n >> q >> m;
for(int i = 1;i<=n;++i)
cin >> p[i];
while(q--){
int l,r;
cin >> l >> r;
deque<int>v;
for(int i = l;i<=r;++i)
v.pb(p[i]);
sort(all(v));
// for(auto it:v)
// cout << it << ' ';
// cout << endl;
for(int i = l;i<=r;++i){
if(l%2 == i%2){
p[i] = v.front();
v.pop_front();
}
else{
p[i] = v.back();
v.pop_back();
}
}
// for(int i = 1;i<=n;++i)
// cout << p[i] << ' ';
// cout << endl;
// wr;
}
for(int i = 1;i<=n;++i){
if(p[i] == m){
cout << i << endl;
return 0;
}
}
assert(false);
return 0;
}
