#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, x;
    cin >> n >> m >> x;
    map<int, VI> mp;
    rep(_, n) {
        int a, b;
        cin >> a >> b;
        mp[b].push_back(a);
    }
    VI evs(n + 1);
    int k;
    cin >> k;
    rep(_, k) {
        int c;
        cin >> c;
        evs[c]++;
    }
    priority_queue<int> q;
    for(auto& [k, v]: mp) {
        sort(rall(v));
        q.push(v[0] + x);
        int sz = v.size();
        for(int i = 1; i < sz; i++) q.push(v[i]);
    }
    ll ans = 0;
    ll now = k;
    rep(i, n) {
        now -= evs[i];
        ans += now * q.top(); q.pop();
    }
    cout << ans << endl;
}