#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;

struct astr {
    double x, y, z;
    unsigned long long ts, uuid;
};

bool cmp (astr a, astr b) {
    return a.ts < b.ts;
}

int main()
{
    vector<astr> v;
    set <unsigned long long> s;
    unsigned long long n;
    double x0, y0, z0, r;
    cin >> x0 >> y0 >> z0 >> r;
    cin >> n;
    for (unsigned long long i = 0; i < n; ++i) {
        astr tmp;
        cin >> tmp.uuid >> tmp.ts >> tmp.x >> tmp.y >> tmp.z;
        v.push_back(tmp);
    }
    sort(v.begin(), v.end(), cmp);
    for (unsigned long long i = 0; i < n; ++i) {
        double l = sqrt((v[i].x - x0) * (v[i].x - x0) + (v[i].y - y0) * (v[i].y - y0) + (v[i].z - z0) * (v[i].z - z0));
        if (l < r) {
            if(s.find(v[i].uuid) == s.end()) {
                cout << v[i].uuid << '\n';
                s.insert(v[i].uuid);
            }
        }
    }
    return 0;
}