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

int main() {

  int N,M,Q;
  cin >> N >> M >> Q;

  vector<pair<int, int>> vec;
  for (int i = 0; i < N; i++) {
    int w,v;
    cin >> w >> v;
    vec.push_back(make_pair(v , w));
  }

  vector<int> X;
  for (int i = 0; i < M; i++) {
    int a;
    cin >> a;
    X.push_back(a);
  }

  for (int i = 0; i < Q; i++) {
    int64_t sum = 0;
    vector<int> Y = X;
    vector<pair<int, int>> VW = vec;
    int qa,qb;
    cin >> qa >> qb;
    Y.erase(Y.begin() + qa-1, Y.begin() + qb);  
    
    // Yの個数分グリーディーに価値が高い順に選ぶ
    // 箱の大きさが小さい順に選んでいく
    sort(Y.begin(), Y.end());
    // 価値が高い順に並べる
    sort(VW.rbegin(), VW.rend());
    
    // 箱の個数分繰り返す
    for (int j = 0; j < Y.size(); j++) {
      int num=0;
      // 箱の大きさ以下でもっとも価値が高いものを選び、潰す
      for (int k = 0; k < VW.size(); k++) {
        if(VW.at(k).second <= Y.at(j)){
          num = VW.at(k).first;
          VW.at(k).second = 1e9;
          break;
        }
      }
      sum += num;
    }


    cout << sum << endl;
  }


}
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<ll,int>
#define PI 3.141592653589793
#define pb push_back
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 998244353;
template<class T> inline bool chmax(T& a, T b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}

int main() {
	int n, m, q;
	cin >> n >> m >> q;
	vector<P> a(n);
	vector<int> x(m);
	rep(i, n) {
		cin >> a[i].second >> a[i].first;
	}
	sort(a.rbegin(), a.rend());
	rep(i, m) cin >> x[i];

	rep(qi, q) {
		ll ans = 0;
		int l, r;
		cin >> l >> r;
		l--; r--;
		vector<int> xi;
		vector<int> c(n);
		rep(j, l) xi.pb(x[j]);
		for (int j = r + 1; j < m; j++) xi.pb(x[j]);
		if (xi.size() == 0) {
			cout << 0 << endl;
			continue;
		}
		sort(xi.begin(), xi.end());
		rep(i, xi.size()) {
			int now = xi[i];
			rep(j, a.size()) {
				if (now >= a[j].second) {
					if (c[j] != 0) continue;
					ans += a[j].first;
					c[j] = 1;
					break;
				}
			}
		}
		cout << ans << endl;
	}

}
