#include <iostream>
#include <vector>
using namespace std;
int main() {
int n,m,p;
cin >> n >> m >> p;
vector<int> A(n);
for(int i = 0; i < n; i++) {
cin >> A[i];
}
char tmp_ch;
int tmp_i;
for(int i = 0; i < m; i++) {
cin >> tmp_ch >> tmp_i;
if (tmp_ch == 'A') A[tmp_i - 1]++;
else A[tmp_i - 1]--;
}
int res = 1;
for(int i = 0; i < n; i++) {
if (A[i] > A[p - 1]) res++;
}
cout << res;
return 0;
}
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
int const maxn = 10000;
int s[maxn],t[maxn];
pair<int,int> line[maxn];
int solve(int n){
int ans = 0;
for(int i = 0; i < n; i++){
line[i].first = t[i];
line[i].second = s[i];
}
sort(line,line+n);
int t = -1e9;//线段末端位置
for(int i = 0; i < n; i++){
if(t <= line[i].second){
ans++;
t = line[i].first;
}
}
return ans;
}
int main(){
int n;
while(scanf("%d",&n) != EOF){
for(int i = 0; i < n; i++) scanf("%d%d",&s[i],&t[i]);
printf("%d\n",solve(n));
}
return 0;
}