#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9;
struct Store {
int x, t, a, b;
};
int n, k, q;
Store stores[400000];
int mini[400000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n >> k >> q;
for(int i = 0; i < n; i++) cin >> stores[i].x >> stores[i].t >> stores[i].a >> stores[i].b;
while(q--) {
int l, y;
cin >> l >> y;
for(int i = 1; i <= k; i++) mini[i] = +oo;
for(int i = 0; i < n; i++)
if(stores[i].a <= y and y <= stores[i].b)
mini[stores[i].t] = min(mini[stores[i].t], abs(l - stores[i].x));
int inconvenience = 0;
for(int i = 1; i <= k; i++) inconvenience = max(inconvenience, mini[i]);
if(inconvenience == +oo) inconvenience = -1;
cout << inconvenience << '\n';
}
}
