import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;

void main() {
    int N;
    scan(N);
    auto adj = new int[][](N, 0);
    foreach (i ; 0 .. N) {
        auto line = readln.split.to!(int[]);
        auto u = line[0] - 1;
        foreach (v ; line[2 .. $]) {
            v--;
            adj[u] ~= v;
        }
    }

    debug {
        //writeln(adj);
    }

    auto d = new int[](N);
    auto f = new int[](N);
    d[] = -1;
    f[] = -1;

    int time;

    void dfs(int v) {
        time++;
        d[v] = time;

        foreach (u ; adj[v]) {
            if (d[u] == -1) {
                dfs(u);
            }
        }

        time++;

        f[v] = time;
    }

    foreach (i ; 0 .. N) {
        if (f[i] == -1) dfs(i);
    }

    foreach (i ; 0 .. N) {
        writefln("%s %s %s", i + 1, d[i], f[i]);
    }
}









void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

