#include <cstdio>
#include <queue>
#include <stack>

using namespace std;

const int inf = 1000000;

int vx1[3][14] = {{0}, {0, -1, 0, 1, 0}, {0, -1, 0, 1, -2, -1, 0, 1, 2, -1, 0, 1, 0}};
int vx2[3][14] = {{0}, {-1, 0, 0, 0, 1}, {-2, -1, -1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 2}};

int v1[] = {-1, 0, 1, 0};
int v2[] = {0, 1, 0, -1};

int p;
int n, m;
int xc, yc;

int mat[205][205];

vector<int> vecini[40404];

stack<int> toShow;

int nrMuchii;
pair<int, int> muchii[105];
int vizMuchie[105];

int getL(int t){
    if(t == 0){
        return 1;
    }
    if(t == 1){
        return 5;
    }
    if(t == 2){
        return 13;
    }
}

void addVulpe(int x, int y, int t){
    int l = getL(t);

    for(int i = 0; i < l; i++){
        mat[x + vx1[t][i]][y + vx2[t][i]] = -1;
    }
}

void citire(){
    scanf("%d %d", &n, &m);
    scanf("%d %d", &xc, &yc);

    for(int i = 0; i <= n + 1; i++){
        mat[i][0] = -1;
        mat[i][m + 1] = -1;
    }

    for(int i = 0; i <= m + 1; i++){
        mat[0][i] = -1;
        mat[n + 1][i] = -1;
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            mat[i][j] = inf;
        }
    }

    int tmp;

    int tmp1, tmp2, tmp3;

    scanf("%d", &tmp);

    for(int i = 0; i < tmp; i++){
        scanf("%d %d %d", &tmp1, &tmp2, &tmp3);
        addVulpe(tmp1, tmp2, tmp3);
    }

    scanf("%d", &tmp);

    int x1, y1, x2, y2;

    for(int i = 0; i < tmp; i++){
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);

        if(mat[x1][y1] != -1){
            mat[x1][y1] = -2;
        }

        if(mat[x2][y2] != -1){
            mat[x2][y2] = -2;
        }

    }
}

void solve(){
    queue<pair<int, int> > Q;

    mat[xc][yc] = 0;
    Q.push({xc, yc});

    while(!Q.empty()){
        int x = Q.front().first;
        int y = Q.front().second;
        Q.pop();

        for(int i = 0; i < 4; i++){
            int xx = x + v1[i];
            int yy = y + v2[i];

            if(mat[xx][yy] > 0 && mat[xx][yy] > mat[x][y] + 1){
                Q.push({xx, yy});
                mat[xx][yy] = mat[x][y] + 1;
            }
            else if(mat[xx][yy] == -2){
                printf("%d %d %d", xx, yy, mat[x][y] + 1);
                return;
            }
        }
    }
}

void citirex(){
    scanf("%d %d", &n, &m);
    scanf("%d %d", &xc, &yc);

    int tmp;

    int tmp1, tmp2, tmp3;

    scanf("%d", &tmp);

    for(int i = 0; i < tmp; i++){
        scanf("%d %d %d", &tmp1, &tmp2, &tmp3);
    }

    scanf("%d", &tmp);

    int x1, y1, x2, y2;

    for(int i = 0; i < tmp; i++){
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);

        int nr1 = x1 * 201 + y1;
        int nr2 = x2 * 201 + y2;

        muchii[nrMuchii] = {nr1, nr2};

        vecini[nr1].push_back(nrMuchii);
        vecini[nr2].push_back(nrMuchii);

        nrMuchii++;
    }
}

void printfx(int x){
    printf("%d %d\n", x / 201, x % 201);
}

void dfs(int x){
    printfx(x);
//    toShow.push(x);

    int l = vecini[x].size();

    for(int i = 0; i < l; i++){
        int m = vecini[x][i];
        int xx = muchii[m].first;
        int yy = muchii[m].second;

        if(xx == x){
            swap(xx, yy);
        }

        if(vizMuchie[m] == false){
            vizMuchie[m] = true;
            dfs(xx);
            printfx(x);
        }
    }

//    toShow.pop();
}

void solvex(){
    for(int i = 0; i < 40404; i++){
        if(vecini[i].size() > 0){
            dfs(i);
            break;
        }
    }
}

int main()
{
    freopen("cartite.in", "r", stdin);
    freopen("cartite.out", "w", stdout);

    scanf("%d", &p);

    if(p == 1){
        citire();
        solve();
    }
    else{
        citirex();
        solvex();
    }



    return 0;
}