#include <bits/stdc++.h>
using namespace std;
int n,m,k,sl[101];
struct food{
	int zf,l;
}a[201];
bool cmp(food x,food y){
	return x.zf>y.zf;
}
int main(){
	cin>>n>>m>>k;
	for (int i=0;i<k;++i){
		cin>>sl[i];
	}
	for (int i=0;i<n;++i){
		cin>>a[i].zf>>a[i].l;
	}
	sort(a,a+n,cmp);
	int total=0;
	for (int i=0;i<n;++i){
		if (sl[a[i].l]>0 && m>0){
			sl[a[i].l]--;m--;total+=a[i].zf;
		}
	}
	cout<<total;
	return 0;
}