#include<bits/stdc++.h>
using namespace std;

using ll = long long;

void solve() {
    int n, m, D, k; cin >> n >> m >> D >> k;
    vector<int> r(k + 5), c(k + 5), s(k + 5);
    vector<vector<int>> a(n + 5, vector<int>(m + 5, -1));
    for (int i = 0; i < k; i++) {
        cin >> r[i] >> c[i] >> s[i];
        a[r[i]][c[i]] = s[i]; 
    }
    vector<vector<int>> h(n + 5, vector<int>(m + 5, 0));
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (a[i][j] != -1) {
                h[i][j + 1] = (a[i][j] - h[i][j]) % D;
                if (h[i][j + 1] < 0) h[i][j + 1] += D;
            }
    for (int i = 0; i < k; i++)
        cout << h[r[i]][c[i]] << ' ' << 0 << ' ' << h[r[i]][c[i] + 1] << ' ' << 0 << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define TASK "GAME"
    if (fopen(TASK".INP", "r")) {
        freopen(TASK".INP", "r", stdin);
        freopen(TASK".OUT", "w", stdout);
    }

    int tests = 1; // cin >> tests;
    while (tests--) solve();

    return 0;
}