#include <bits/stdc++.h>

//#define max(list_) (*max_element(begin(list_), end(list_)))
//#define min(list_) (*min_element(begin(list_), end(list_)))
//#define indexOf(list_, value) (*find(begin(list_), end(list_), value))

using namespace std;

int main(){
    int N, L, K;
    cin >> N;
    cin >> L;
    cin >> K;
    vector<int> Tx(N);
    vector<int> Ty(N);
    vector<int> Vx(N);
    vector<int> Vy(N);
    vector<float> Px(N);
    vector<float> Py(N);
    /*vector<int> Tx_(N);
    vector<int> Ty_(N);

    for(int i=0; i<N; i++){
        cin >> Tx[i];
        cin >> Vx[i];
        Tx_[i] = Tx[i];
    }
    for(int i=0; i<N; i++){
        cin >> Ty[i];
        cin >> Vy[i];
        Ty_[i] = L/Vy[i] - Ty[i];
    }

    int l = 0;

    */


    for(int i=0; i<N; i++){
        cin >> Tx[i];
        cin >> Vx[i];
        Px[i] = Vx[i] * -Tx[i];
    }
    for(int i=0; i<N; i++){
        cin >> Ty[i];
        cin >> Vy[i];
        Py[i] = L + Vy[i] * Ty[i];
    }

    int l = 0;

    int Xm = 0;
    int Ym = L;
    int Xmi = 0;
    int Ymi = 0;
    for(float i=0, d = 0.1; l<K; i+=d){
        if(Xm >= Ym){
            l++;
            cout << Xmi + 1 << " " << Ymi + 1 << endl;

            Px[Xmi] = INT_MIN;
            Vx[Xmi] = 0;
            Py[Ymi] = INT_MAX;
            Vy[Ymi] = 0;
        }
        Xm = INT_MIN; Ym = INT_MAX;
        Xmi = -1; Ymi = -1;
        for(int j=0; j<N; j++){
            Px[j] += Vx[j]*d;
            if(Px[j] > Xm) Xm = Px[j], Xmi = j;
            Py[j] -= Vy[j]*d;
            if(Py[j] < Ym) Ym = Py[j], Ymi = j;
        }
    }
}