#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

#include <queue>
#include <cstdlib>

using i64 = long long;
using u64 = unsigned long long;

const i64 INF = 1e18;

const int N = 2e5;

int n, m, k;
int a[N + 5];
int c[N + 5];

void print() {
	while (k--) {
		std::cout << "-1\n";
	}
	exit(0);
}

struct info {
	int L, R;
	i64 sum = 0;
	
	std::vector<int> cost;
	std::vector<i64> ans;
	
	struct node {
		int id, x, y; i64 sum;
		bool operator <	(const node &rhs) const { return sum > rhs.sum; }
	};
	
	std::priority_queue<node> q;
	
	void insert(int x) {
		cost.emplace_back(x);
	}
	
	void init() {
		if ((int)cost.size() < L) {
			print();
		}
		std::sort(cost.begin(), cost.end());
		if (L == 0) ans.emplace_back(0);
		i64 sum = 0;
		for (int i = 0; i < std::min(R, (int)cost.size()); i++) {
			sum += cost[i];
			if (i + 1 >= L) {
				q.push({i, i, (int)cost.size() - 1, sum});
			}
		}
	}
	
	i64 kth(int k) {
		while (k > (int)ans.size() && !q.empty()) {
			node now = q.top(); q.pop();
			ans.emplace_back(now.sum);
			if (now.x + 1 <= now.y) q.push({now.id, now.x + 1, now.y, now.sum + cost[now.x + 1] - cost[now.x]});
			if (now.id && now.id < now.x) q.push({now.id - 1, now.id, now.x - 1, now.sum + cost[now.id] - cost[now.id - 1]});
		}
		return k > (int)ans.size() ? INF : ans[k - 1];
	}
} g[N + 5];

std::pair<i64, int> v[N + 5];
	
struct node {
	int id, x; i64 sum;
	bool operator <	(const node &rhs) const { return sum > rhs.sum; }
};

std::priority_queue<node> q;

void solve() {
	std::cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
		std::cin >> a[i] >> c[i];
	for (int i = 1; i <= n; i++)
		g[a[i]].insert(c[i]);
	for (int i = 1; i <= m; i++)
		std::cin >> g[i].L >> g[i].R;
	for (int i = 1; i <= m; i++)
		g[i].init();
	i64 sum = 0;
	for (int i = 1; i <= m; i++) {
		sum += g[i].kth(1);
		v[i] = {g[i].kth(2) - g[i].kth(1), i};
	}
	std::sort(v + 1, v + m + 1);
	q.push({1, 2, sum + v[1].first});
	k--;
	std::cout << sum << "\n";
	while (k--) {
		node now = q.top(); q.pop();
		if (now.sum >= INF) k++, print();
		std::cout << now.sum << "\n";
		int i = v[now.id].second;
		q.push({now.id, now.x + 1, now.sum + g[i].kth(now.x + 1) - g[i].kth(now.x)});
		if (now.id < m) {
			q.push({now.id + 1, 2, now.sum + v[now.id + 1].first});
			if (now.x == 2) q.push({now.id + 1, 2, now.sum + v[now.id + 1].first - v[now.id].first});
		}
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	std::cerr.tie(nullptr);
	
	int t = 1;
//	std::cin >> t;
	
	while (t--) {
		solve();
	}
	
	return 0;
}