#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

struct pl {
    long long st, tm;
    int dir;
} z[N];

struct op {
    int opt, id;
    long long pos;

    int operator < (const op y) const {
        return opt != y.opt ? opt < y.opt : id < y.id;
    }

    int operator > (const op y) const {
        return opt != y.opt ? opt > y.opt : id > y.id;
    }
};

long long L, T;
priority_queue< pair<long long, op>, vector< pair<long long, op> >, greater< pair<long long, op> > > pq;
set<int> toilets;
set< pair<long long, int> > people[2];

long long calc(int id, long long pos, long long Tm) {
    long long md;
    if (z[id].dir == -1) {
        md = ((z[id].st - pos) % L + L) % L;
    } else {
        md = ((pos - z[id].st) % L + L) % L;
    }
    long long v1 = Tm / L * L + md;
    return (v1 < Tm ? v1 + L : v1);
}

int FindNext(long long x) {
    x = (x % L + L) % L;
    if (people[0].lower_bound(make_pair(x, 0)) != people[0].end()) {
        return (*people[0].lower_bound(make_pair(x, 0))).second;
    }
    return (*people[0].begin()).second;
}

int FindPrev(long long x) {
    x = (x % L + L) % L;
    if (people[1].lower_bound(make_pair(x, 1e9)) != people[1].begin()) {
        return (*people[1].lower_bound(make_pair((*--people[1].lower_bound(make_pair(x, 1e9))).first, 0))).second;
    }
    return (*people[1].lower_bound(make_pair((*--people[1].end()).first, 0))).second;
}

void active(long long x) {
    toilets.insert(x);
    if (!people[0].empty()) {
        op tz; tz.opt = 3;
        tz.id = FindNext(x + T);
        tz.pos = x;
        long long Tm = calc(tz.id, x, T);
        pq.push(make_pair(Tm, tz));
    }
    if (!people[1].empty()) {
        op tz; tz.opt = 3;
        tz.id = FindPrev(x - T);
        tz.pos = x;
        long long Tm = calc(tz.id, x, T);
        pq.push(make_pair(Tm, tz));
    }
}

long long FindNxt(long long x) {
    x = (x % L + L) % L;
    if (toilets.lower_bound(x) != toilets.end()) {
        return *toilets.lower_bound(x);
    }
    return *toilets.begin();
}

long long FindPre(long long x) {
    x = (x % L + L) % L;
    if (toilets.upper_bound(x) != toilets.begin()) {
        return *--toilets.upper_bound(x);
    }
    return *--toilets.end();
}

void addPeople(int id) {
    if (z[id].dir == -1) {
        people[0].insert(make_pair(z[id].st, id));
        if (!toilets.empty()) {
            op tz; tz.opt = 3;
            tz.id = id;
            tz.pos = FindPre(z[id].st - T);
            long long Tm = calc(id, tz.pos, T);
            pq.push(make_pair(Tm, tz));
        }
    } else {
        people[1].insert(make_pair(z[id].st, id));
        if (!toilets.empty()) {
            op tz; tz.opt = 3;
            tz.id = id;
            tz.pos = FindNxt(z[id].st + T);
            long long Tm = calc(id, tz.pos, T);
            pq.push(make_pair(Tm, tz));
        }
    }
}

void process(op x) {
    toilets.erase(x.pos);
    if (z[x.id].dir == -1) {
        people[0].erase(make_pair(z[x.id].st, x.id));
    } else {
        people[1].erase(make_pair(z[x.id].st, x.id));
    }
    op tmp; tmp.opt = 1, tmp.pos = x.pos;
    pq.push(make_pair(T + z[x.id].tm, tmp));
    long long pos = x.pos;
    if (!people[0].empty()) {
        addPeople(FindNext(pos + T));
    }
    if (!people[1].empty()) {
        addPeople(FindPrev(pos - T));
    }
}

long long res1[N], res2[N];

signed main() {
    int n, m;
    scanf("%d%d%lld", &n, &m, &L);
    for (int i = 1; i <= m; ++i) {
        long long ps;
        scanf("%lld", &ps);
        active(ps);
    }
    for (int i = 1; i <= n; ++i) {
        long long t; scanf("%lld", &t);
        long long ps; scanf("%lld", &ps);
        string tdir; cin >> tdir;
        int dir = (tdir[0] == '+' ? 1 : -1);
        long long tm; scanf("%lld", &tm);
        op now;
        now.opt = 2, now.id = i;
        z[i].st = ((ps - t * dir) % L + L) % L;
        z[i].tm = tm;
        z[i].dir = dir;
        pq.push(make_pair(t, now));
    }
    memset(res1, -1, sizeof(res1));
    while (!pq.empty()) {
        T = pq.top().first;
        op now = pq.top().second;
        pq.pop();
        if (now.opt == 1) {
            active(now.pos);
        } else if (now.opt == 2) {
            addPeople(now.id);
        } else if (!~res1[now.id] && toilets.find(now.pos) != toilets.end()) {
            res1[now.id] = T, res2[now.id] = now.pos;
            process(now);
        }
    }
    for (int i = 1; i <= n; ++i) {
        printf("%lld %lld\n", res2[i], res1[i]);
    }
    return 0;
}