import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }
double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto M = RD;
	auto X = RD;
	auto a = new long[][](N, 2);
	auto b = new long[][](N, 2);
	foreach (i; 0..N)
	{
		auto A = RD;
		auto B = RD-1;
		a[i] = [A, B, i];
		b[i] = [A, B, i];
	}
	auto K = RD;
	auto C = RDA;

	a.sort!"a[0] > b[0]";
	b.sort!"a[0] > b[0]";
	
	long[][] arr;
	auto used_t = new long[](M);
	auto used_i = new long[](N);
	foreach (i; 0..N)
	{
		while (used_i[a[0][2]])
			a.popFront;
		while (!b.empty)
		{
			if (!used_t[b[0][1]]) break;
			b.popFront;
		}
		auto nd = a.front;
		auto aa = nd[0];
		auto ab = nd[1];
		auto ai = nd[2];
		if (!used_t[ab] || b.empty)
		{
			used_t[ab] = true;
			used_i[ai] = true;
			arr ~= [aa, ab];
			continue;
		}
		auto nd2 = b.front;
		auto ba = nd2[0];
		auto bb = nd2[1];
		auto bi = nd2[2];
		auto d = aa - ba;
		if (d >= X)
		{
			used_t[ab] = true;
			used_i[ai] = true;
			arr ~= [aa, ab];
		}
		else
		{
			used_t[bb] = true;
			used_i[bi] = true;
			arr ~= [ba, bb];
		}
	}

	used_t[] = false;
	auto c = new long[](N+1);
	foreach (i; 0..N)
	{
		c[i+1] = c[i] + arr[i][0];
		if (!used_t[arr[i][1]])
			c[i+1] += X;
		used_t[arr[i][1]] = true;
	}
	debug writeln(c);

	C.sort;
	long ans;
	foreach (i; 0..K)
	{
		ans += c[C[i]];
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}