#include <bits/stdc++.h>

using namespace std;

#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define MOD9 998244353
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double

#define int long long

using II = pair<int, int>;

int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int extgcd(int a, int b, int &x, int &y) { int g = a; x = 1; y = 0; if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x; return g; }

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a)  begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())

const int MAX_N = 200005;
const int MAX_M = 200005;
const int MAX_K = 200005;

int N, M, X;
int A[MAX_N], B[MAX_N];
vector<int> BB[MAX_M];
int K;
int C[MAX_K];

signed main() {
    cin >> N >> M >> X;
    REP(n, N) {
        cin >> A[n] >> B[n]; B[n]--;
        BB[B[n]].emplace_back(A[n]);
    }

    cin >> K;
    REP(k, K) {
        cin >> C[k];
    }

    sort(C, C+K);

    vector<int> S;
    vector<int> sumS(N+1);
    REP(m, M) {
        sort(begin(BB[m]), end(BB[m]), greater<int>());
        REP(i, BB[m].size()) {
            if (i == 0) {
                S.emplace_back(X + BB[m][i]);
            } else {
                S.emplace_back(BB[m][i]);
            }
        }
    }

    sort(begin(S), end(S), greater<int>());
    REP(n, N) {
        sumS[n+1] = sumS[n] + S[n];
    }

    int ans = 0;
    REP(k, K) {
        ans += sumS[C[k]];
    }
    cout << ans << endl;

    return 0;
}