#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=1e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(".in", "r", stdin); freopen(".out", "w", stdout);
int n,k,q; cin>>n>>k>>q;
vector<pair<int,pair<int,pair<int,int> > > > v;
for (int i=0;i<n;i++) {
int a,b,c,d; cin>>a>>b>>c>>d;
v.push_back({c,{0,{a,b}}});
v.push_back({d,{2,{a,b}}});
}
for (int i=0;i<q;i++) {
int l,y; cin>>l>>y;
v.push_back({y,{1,{l,i}}});
}
sort(v.begin(),v.end());
int ans[q];
int dis[k];
for (int i=0;i<q;i++) ans[i]=-1;
set<pair<int,int> > st;
map<pair<int,int>,int> mp;
for (int i=0;i<v.size();i++) {
if (v[i].second.first==0) {
int lc=v[i].second.second.first,tp=v[i].second.second.second;
if (mp[{lc,tp}]==0) st.insert({lc,tp});
mp[{lc,tp}]++;
}
else if (v[i].second.first==1) {
int lc=v[i].second.second.first,indx=v[i].second.second.second;
for (int j=0;j<k;j++) dis[j]=-1;
auto j=st.begin();
for (auto &j:st) {
if (dis[j.second-1]==-1) dis[j.second-1]=abs(j.first-lc);
else dis[j.second-1]=min(dis[j.second-1],abs(j.first-lc));
}
int mx=0;
for (int j=0;j<k;j++) {
if (dis[j]==-1) {mx=-1; break;}
mx=max(mx,dis[j]);
}
ans[indx]=mx;
}
else {
int lc=v[i].second.second.first,tp=v[i].second.second.second;
mp[{lc,tp}]--;
if (mp[{lc,tp}]==0) st.erase({lc,tp});
}
}
for (int i=0;i<q;i++) cout<<ans[i]<<endl;
}
