Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

const MAX = 101

var f [MAX]int
var d [MAX]int
var list [][]int
var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func dfs(u, cnt int) int {
	if d[u] != 0 {
		return cnt
	}

	cnt++
	d[u] = cnt
	for _, next := range list[u] {
		cnt = dfs(next, cnt)
	}
	cnt++
	f[u] = cnt
	return cnt
}

func main() {
	n := scanInt()
	list = make([][]int, n+1)
	for i := 1; i <= n; i++ {
		u := scanInt()
		k := scanInt()
		for j := 0; j < k; j++ {
			n := scanInt()
			list[u] = append(list[u], n)
		}
	}

	cnt := 0
	for i := 1; i <= n; i++ {
		cnt = dfs(i, cnt)
	}

	w := bufio.NewWriter(os.Stdout)
	for i := 1; i <= n; i++ {
		fmt.Fprint(w, i)
		fmt.Fprint(w, " ")
		fmt.Fprint(w, d[i])
		fmt.Fprint(w, " ")
		fmt.Fprint(w, f[i])
		fmt.Fprintln(w)
	}
	w.Flush()
}

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

#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
//constexpr long long MOD = 998244353LL;
using ld = long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;

template <class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
    ll to, rev;
    long double cap;
    Edge(ll _to, long double _cap, ll _rev) {
        to = _to;
        cap = _cap;
        rev = _rev;
    }
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;

void add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,
              long double revCap) {
    G[from].push_back(Edge(to, cap, (ll)G[to].size()));
    if(revFlag)
        G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}

void solve() {
    ll n;
    cin >> n;
    Graph g(n);
    REP(i, n) {
        ll u, k;
        cin >> u >> k;
        u--;
        REP(j, k) {
            ll v;
            cin >> v;
            v--;
            add_edge(g, u, v, 1, false, 1);
        }
    }

    Array d(n, 0);
    Array f(n, 0);
    int id = 1;
    auto dfs = [&](auto &&self, int v) -> void {
        d[v] = id;
        id++;
        for(auto e : g[v]) {
            if(d[e.to])
                continue;
            self(self, e.to);
        }
        f[v] = id;
        id++;
    };
    REP(i, n) {
        if(d[i])
            continue;
        dfs(dfs, i);
    }
    REP(i, n) {
        cout << i + 1 << " " << d[i] << " " << f[i] << en;
    }
}

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

    solve();

    /*
    ll t;
    cin >> t;
    REP(i, t) { solve();}
    */

    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <stack>
using namespace std;

int N;
const int maxn = 105;
const int WHITE = 0;
const int BLACK = 2;
int G[maxn][maxn];
vector<int> color;
vector<int> startTime;
vector<int> endTime;
vector<int> nt;

int getNext(int u){
    int res = -1;
    for(int i = nt[u];i<N;i++){
        if(G[u][i] && color[i]==WHITE){
            res = i;
            nt[u] = i;
            break;
        }
    }
    return res;
}

void DFS(int u,int &time){
    if(color[u]!=WHITE) return;
    stack<int> nodeStack;
    nodeStack.push(u);
    startTime[u] = time++;
    while(!nodeStack.empty()){
        int u = nodeStack.top();
        //if(color[u]!=WHITE) continue;
        color[u] = BLACK;

        int v = getNext(u);
        if(v!=-1){
            startTime[v] = time++;
            nodeStack.push(v);
            continue;
        }
        else{
            endTime[u] = time++;
            nodeStack.pop();
        }
    }
}

int main(){
    //freopen("data.txt","r",stdin);
    memset(G,0,sizeof(G));
    cin >> N;
    color.resize(N,WHITE);
    startTime.resize(N,0);
    endTime.resize(N,0);
    nt.resize(N,0);
    int u,k;
    for(int i = 0;i<N;i++){
        scanf("%d %d",&u,&k);
        u--;
        for(int j = 0;j<k;j++){
            int v;
            scanf("%d",&v);
            v--;
            G[u][v] = 1;
        }
    }
    int time = 1;
    for(int i = 0;i<N;i++) if(color[i]==WHITE) DFS(i,time);
    for(int u = 0;u<N;u++){
        printf("%d %d %d\n",u+1,startTime[u],endTime[u]);
    }
    return 0;
}

C++: #include<iostream>
#include<stack>
using namespace std;
static const int N = 100;
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, tt;
int M[N][N], color[N], d[N], f[N], nt[N]; 

int next(int u){
	for(int v = nt[u]; v < n; v++) {
		if(M[u][v] == 1) return v;
		nt[u] = v + 1;
	}
	return -1;
}

void dfs_visit(int r) {
    for(int i = 0; i < n; i++) {
        nt[i] = 0;
	}
	stack<int> S;
	S.push(r);
	color[r] = GRAY;
	d[r] = ++tt;
	while(!S.empty()) {
		int u = S.top();
		int v = next(u);
		if(v != -1) {
			if(color[v] == WHITE) {
			   color[v] = GRAY;
			   d[v] = ++tt;
			   S.push(v); 	
			}
		} else {
		   color[u] = BLACK;
		   S.pop();
		   f[u] = ++tt;
		}
	} 
}


void dfs() {
	for(int i = 0; i < n; i++) {
	     color[i] = WHITE;
	}	
	for(int u = 0; u < n; u++) {
		if(color[u] == WHITE) dfs_visit(u);
	}
	for(int i = 0; i < n; i++) {
		cout << i + 1 << " " << d[i] << " " << f[i] << endl;	
	}
}

int main() {
	int n, k , u, v;
	tt = 0;
	cin >> n;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) {
			M[i][j] = 0;
		}
	}
	cin >> k >> u;
	u--;
	for(int i = 0; i < k; i++) {
	    cin >> v;
	    v--;
		M[u][v] = 1; 
	}
	dfs();
	return 0;
}