#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define P pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) UB(A,x)-LB(A,x) templateusing min_priority_queue=priority_queue,greater>; using mint=modint1000000007; //using mint=modint998244353; signed main(){ ll N,M,X;cin>>N>>M>>X; vector>A(M); REP(i,N){ll a,b;cin>>a>>b;A[b-1].push_back(a);} vectorB; REP(i,M)if(A[i].size()){ sort(ALL(A[i]));reverse(ALL(A[i]));A[i][0]+=X;for(ll j:A[i])B.push_back(j); } sort(ALL(B));B.push_back(0);reverse(ALL(B)); REP(i,N)B[i+1]+=B[i]; ll K,ans=0;cin>>K; REP(i,K){ll c;cin>>c;ans+=B[c];} cout<