#include <bits/stdc++.h>

using ll = long long;
using namespace std;
const ll INF = 1e18;

const int MAXN = 151;

int a[MAXN], b[MAXN];
int s[MAXN][2], s2[MAXN][2];

int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int n, k; cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> s[i][0] >> s[i][1];
    }

    cin >> k;

    b[1] = 0;
    b[2] = 1;

    for (int i = 1; i <= 2; i++) {
        for (int j = 1; j <= 2; j++) {
            for (int c = 1; c <= 2; c++) {
                for (int d = 1; d <= 2; d++) {
                    s2[1][0] = i;
                    s2[1][1] = j;
                    s2[2][0] = c;
                    s2[2][1] = d;
                    bool g = true;
                    for (int start = 1; start <= n && g; start++) {
                        int left = k;
                        int stB = 1;
                        int st = start;
                        for (int it = 0; it <= 10; it++) {
                            int o1 = a[st];
                            int o2 = b[stB];
                            if (o1 != o2) {
                                if (left == 0) {
                                    g = false;
                                    break;
                                }
                                left--;
                            }
                            st = s[st][o2];
                            stB = s2[stB][o1];
                        }
                    }

                    if (g) {
                        cout << "2 1\n";
                        cout << b[1] << " " << s2[1][0] << " " << s2[1][1] << "\n" << b[2] << " " << s2[2][0] << " " << s2[2][1] << "\n";
                        exit(0);
                    }
                }
            }
        }
    }

    return 0;
}