#include <bits/stdc++.h>
//#include "bits_stdc++.h"
//#include <initializer_list>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i)
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
// UFDS
ll par[5005], siz[5005];
ll find(ll x){return ((par[x]==x)?x:par[x] = find(par[x]));}
void unite(ll x, ll y)
{
x= find(x), y = find(y);
if (siz[x] < siz[y]) swap(x,y);
siz[x] += siz[y];
par[y] = x;
}
ll lable = 4;
ll x[2005], y[20005], r[2005];
vector<pii> q;
string ans[100005];
vector<pii> upd;
bool compare(pii a, pii b){ return a.f < b.f;}
void update(ll idx1, ll idx2)
{
ll xx = abs(x[idx1]-x[idx2]), yy = abs(y[idx1] - y[idx2]);
ll sq = xx*xx + yy*yy;
ll lo = 0, hi = 3e9;
while (lo!=hi)
{
ll mid = (lo+hi)/2;
if (mid*mid >= sq) hi = mid;
else lo = mid+1;
}
ll dist = lo - r[idx1] - r[idx2];
upd.pb(mp(dist, mp(idx1 , idx2)));
}
int main()
{
ll n,m , w, h;
input4(n, m, w, h);
q.resize(m);
for (ll i=1; i<n+5; ++i) par[i] = i, siz[i]=1;
//for (ll i=1; i<=4; ++i) minx[i] = miny[i] = INF, maxx[i], maxy[i] = -INF;
for (ll i=0; i<n; ++i)
{
input3(x[i+5], y[i+5], r[i+5]);
//minx[i+5] = maxx[i+5] = x[i+5];
//miny[i+5] = maxy[i+5] = y[i+5];
// Reset
x[1] = x[3] = x[i+5];
y[1] = 0, y[3] = h;
x[2] = w, x[4] = 0;
y[2] = y[4] = y[i+5];
r[1] = r[2] = r[3] =r[4] = 0;
// Add edges
for (ll j=1; j<=4; ++j) update(j, i+5);
}
for (ll i=5; i<n+5; ++i) for (ll j=i+1; j<n+5; ++j) update(i, j);
for (ll i=0; i<m; ++i) {input2(q[i].f, q[i].s.f); q[i].s.s = i;}
sort(all(upd), compare);
sort(all(q), compare);
ll idx = -1;
for (pii u: q)
{
//show(u.s.s);
while (idx + 1 < upd.size() && upd[idx+1].f<= u.f*2)
{
idx++;
unite(upd[idx].s.f, upd[idx].s.s);
//show3(upd[idx].f, upd[idx].s.f, upd[idx].s.s);
}
vector<vector<ll> > dp(5, vector<ll> (5, 0));
vector<vector<ll> > dp2(5, vector<ll> (5, 1));
for (ll i=1; i<=4; ++i) for (ll j=1; j<=4; ++j) {if (find(i)==find(j)) dp[i][j]=1;}
// dist = 1
for (ll i=1; i<=4; ++i)
{
ll nxt = (i==4)?1:i+1;
if (dp[i][nxt]) for (ll j=1; j<=4; ++j) if (nxt!=j) dp2[j][nxt] = dp2[nxt][j] = 0;
}
// dist = 2
ll aa[2] = {1, 4}, bb[2] = {2,3};
if (dp[1][3]) for (ll j: aa) for (ll i: bb) if (i!=j) dp2[j][i] = dp2[i][j] = 0;
if (dp[2][4]) for (ll j=1; j<=2; ++j) for (ll i=3; i<=4; ++i) if (i!=j) dp2[j][i] = dp2[i][j] = 0;
ans[u.s.s] = "";
for (ll i=1; i<=4; ++i) if (dp2[u.s.f][i]) ans[u.s.s] += to_string(i);
}
for (ll i=0; i<m; ++i) cout << ans[i] << endl;
return 0;
}
