#include <bits/stdc++.h>
using namespace std;

const int N = 50 + 9;

pair<int, int> a[N];
int x[N];

int main(){
    int n, m, q;
    scanf("%d %d %d", &n, &m, &q);
    for (int i = 1; i <= n; ++i){
        scanf("%d %d", &a[i].first, &a[i].second);
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= m; ++i){
        scanf("%d", x + i);
    }
    for (int i = 1; i <= q; ++i){
        int l, r;
        scanf("%d %d", &l, &r);
        vector<int> vc;
        for (int j = 1; j <= m; ++j){
            if (!(l <= j && j <= r)) vc.push_back(x[j]);
        }
        sort(vc.begin(), vc.end());
        priority_queue<int> pq;
        int ans = 0;
        for (int j = 0, sz = vc.size(), k = 1; j < sz; ++j){
            while (k <= n && a[k].first <= vc[j]){
                pq.push(a[k].second);
                ++k;
            }
            if (!pq.empty()){
                ans += pq.top();
                pq.pop();
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}

#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}


void solve() {
	int n, m, q; cin >> n >> m >> q;
	vector<int> w(n), v(n);
	rep(i, n)cin >> w[i] >> v[i];
	vector<int> x(m);
	rep(i, m)cin >> x[i];
	vector<P> vp;
	rep(i, n) {
		vp.push_back({ v[i],w[i] });
	}
	sort(all(vp), greater<P>());
	rep(i, q) {
		int l, r; cin >> l >> r; l--; r--;
		multiset<int> st;
		rep(j, m) {
			if (l <= j && j <= r)continue;
			st.insert(x[j]);
		}
		int ans = 0;
		for (P p : vp) {
			int val = p.first;
			int wei = p.second;
			if (st.find(wei) != st.end()) {
				ans += val; st.erase(st.find(wei));
			}
			else {
				st.insert(wei);
				auto itr = st.find(wei);
				itr++;
				if (itr != st.end()) {
					ans += val; st.erase(itr);
				}
				st.erase(st.find(wei));
			}
		}
		cout << ans << "\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}