#include<bits/stdc++.h>
using namespace std;
struct node
{
	int zf,zl;
}a[105];
int n,m,k,sum[105],ans;
bool cmp(node x,node y)
{
	return x.zf>y.zf;
}
int main()
{
    cin>>n>>m>>k;
    for(int i=1;i<=k;i++)
    	cin>>sum[i];
    for(int i=1;i<=n;i++)
    	cin>>a[i].zf>>a[i].zl;
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=n;i++)
    {
    	if(m==0)
    		break;
    	if(sum[a[i].zl]==0)
    		continue;
    	ans+=a[i].zf;
    	sum[a[i].zl]--;
	}
	cout<<ans;
    return 0;
}

只对了4.5.6三个点