#include<bits/stdc++.h>
using namespace std;
#define N 200005
typedef long long ll;
const ll inf=1e18;
int n,m,k,p[N];
ll sum;
struct Node{
    vector<ll>ans;
    vector<int>a;
    int l,r;
    ll sum;
    struct node{
        int a,b,c,type;
        ll w;
        bool operator<(const node&x)const{return w>x.w;}
    };
    priority_queue<node>q;
    void put(node u){
        if(u.a==u.b&&u.c==(int)a.size()&&u.a<u.c&&u.a+1<r)//(i,i,n+1)->(i+1,i+1,n+1) (i+1<r)
            q.push({u.a+1,u.b+1,u.c,1,u.w+a[u.b+1]});
        if(u.b+1<u.c)q.push({u.a,u.b+1,u.c,1,u.w+a[u.b+1]-a[u.b]});//(i,j,k)->(i,j+1,k);
        if(u.a>0&&u.b>u.a+1)q.push({u.a-1,u.a-1,u.b,0,u.w});//(i,j,k)->(i-1,i-1,j);
    }
    ll get(int x){
        if((int)ans.size()>x)return ans[x];
        node u;
        while((int)ans.size()<=x){
            while(!q.empty()&&q.top().type==0)
                u=q.top(),q.pop(),put(u);
            if(q.empty())return inf;
            u=q.top();q.pop();put(u);
            ans.push_back(u.w);
        }
        return u.w;
    }
    void init(){
        if(!l)ans.push_back(0),l=1;///
        if((int)a.size()<l||l>r){
            ans.push_back(inf);
            ans.push_back(inf);
            return;
        }
        sort(a.begin(),a.end());
        for(int i=0;i<l;++i)sum+=a[i];
        q.push({max(l-1,0),max(l-1,0),(int)a.size(),1,sum});
    }
}a[N];
bool cmp(int i,int j){
    return a[i].get(1)-a[i].get(0)<a[j].get(1)-a[j].get(0);
}
struct node{
    int a,b;
    ll w;
    bool operator<(const node&x)const{return w>x.w;}
};
priority_queue<node>q;
int main(){
    int x,y;
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;++i){
        scanf("%d%d",&x,&y);
        a[x].a.push_back(y);
    }
    for(int i=1;i<=m;++i){
        scanf("%d%d",&a[i].l,&a[i].r);
        a[p[i]=i].init();
    }
    sort(p+1,p+m+1,cmp);
    for(int i=1;i<=m;++i){
        sum+=a[i].get(0);
        if(sum>=inf){
            while(k--)printf("-1\n");
            return 0;
        }
    }
    q.push({1,0,sum});
    while(k--){
        if(q.empty()||q.top().w>=inf){
            printf("-1\n");
            while(k--)printf("-1\n");
            return 0;
        }
        auto u=q.top();q.pop();
        x=u.a;y=u.b;
        printf("%lld\n",u.w);
        q.push({x,y+1,u.w+a[p[x]].get(y+1)-a[p[x]].get(y)});//(i,j)->(i,j+1)
        if(x<m&&y==1)q.push({x+1,1,u.w+a[p[x+1]].get(1)-a[p[x+1]].get(0)-(a[p[x]].get(1)-a[p[x]].get(0))});
        if(x<m&&y>0)q.push({x+1,1,u.w+a[p[x+1]].get(1)-a[p[x+1]].get(0)});
    }
    return 0;
}
/*
22 22 199709
12 52
5 69
5 3
5 292
12 29
5 129
20 134
12 9
14 1
12 218
12 111
12 37
22 41
11 71
5 54
5 208
12 112
5 242
2 64
22 146
5 134
22 61
0 0
0 1
0 0
0 0
0 6
0 0
0 0
0 0
0 0
0 0
0 0
0 6
0 0
0 1
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 3

*/
/*
26 26 200000
1 174
1 156
2 5
19 38
5 51
15 283
15 222
5 16
16 277
1 114
1 3
1 17
2 139
1 51
5 160
1 78
1 233
1 17
1 201
5 99
1 51
17 15
1 122
17 33
17 241
1 6
6 9
0 1
0 0
0 0
0 4
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
1 12
0 2
0 0
1 1
0 0
0 0
0 0
0 0
0 0
0 0
0 0

*/