#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
int n, k, q;
cin >> n >> k >> q;
vi x(n), t(n), a(n), b(n);
rep(i, n) cin >> x[i] >> t[i] >> a[i] >> b[i], t[i]--;
rep(i, q){
int l, y;
cin >> l >> y;
vi vis(k, 0);
vi mx(k, 1e9);
int cnt = 0;
rep(j, n) if(y >= a[j] && y <= b[j]){
if(!vis[t[j]]) cnt++;
vis[t[j]] = 1;
mx[t[j]] = min(mx[t[j]], abs(l - x[j]));
}
if(cnt != k) cout << -1 << endl;
else cout << *max_element(all(mx)) << endl;
}
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
