Go: package main

import (
	"fmt"
)

func main() {
	var n int
	fmt.Scan(&n)
	g := make([][]int, n+1)
	for i := 0; i < n; i++ {
		var u,k int
		fmt.Scan(&u)
		fmt.Scan(&k)
		g[u] = make([]int, k)
		for j := 0; j < k; j++ {
			fmt.Scan(&g[u][j])
		}
	}

	d := make([]int, n+1)
	f := make([]int, n+1)
	t := 1
	for i := 1; i <= n; i++ {
		t = dfs(&g, &d, &f, i, t)
	}

	for i := 1; i <= n; i++ {
		fmt.Printf("%d %d %d\n", i, d[i], f[i])
	}
}

func dfs(g *[][]int, d *[]int, f *[]int, id int, t int) int {
	if (*d)[id] > 0 {
		return t
	}
	(*d)[id] = t
	t += 1
	for i := 0; i < len((*g)[id]); i++ {
		t = dfs(g, d, f, (*g)[id][i], t)
	}
	(*f)[id] = t
	return t+1
}

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, M[N][N];
int color[N], d[N], f[N], tt;
int nt[N];

/**
  *??£??\?????¢???
  */
int next(int u) {
  for(int v = nt[u]; v < n; v++) {
    nt[u] = v + 1;
    if(M[u][v]) return v;
  }
  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 {
      //??£???????????¨?????¢?´¢?????????
      S.pop();
      color[u] = BLACK;
      f[u] = ++tt;
    }
  }
}

/**
  *?????£?????°???????????¢?´¢??????????????????
  **/
void dfs() {
  //init
  for(int i = 0; i < n; i++) {
    color[i] = WHITE;
    nt[i] = 0;
  }
  tt = 0;


  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(void) {
  int u, k, v;
  cin >> n;
  //init
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      M[i][j] = 0;
    }
  }


  //??£??\???????????¨??????0-origin?????£??\???????????????
  for(int i = 0; i < n; i++) {
    cin >> u >> k;
    u--;
    for(int j = 0; j < k; j++) {
      cin >> v;
      v--;
      M[u][v] = 1;
    }
  }

  dfs();

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2

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

// 再帰関数による深さ優先探索

void dfs_visit(int u) {
    int v;
    color[u] = GRAY;
    d[u] = ++tt; // 最初の訪問
    for (v = 0; v < n; ++v) {
        if (M[u][v] == 0) continue;
        if (color[v] == WHITE) {
            dfs_visit(v);
        }
    }

    color[u] = BLACK;
    f[u] = ++tt; // 訪問の完了
}

void dfs() {
    int u;
    // 初期化
    for (u = 0; u < n; ++u) color[u] = WHITE;
    tt = 0;

    for (u = 0; u < n; ++u) {
        // 未訪問の u を始点として深さ優先探索
        if (color[u] == WHITE) dfs_visit(u);
    }
    for (u = 0; u < n; ++u) {
        printf("%d %d %d\n", u+1, d[u], f[u]);
    }
}

int main() {
    int u, v, k, i, j;

    scanf("%d", &n);
    for (i = 0; i < n; ++i) {
        for (j = 0; j < n; j++) M[i][j] = 0;
    }

    for (i = 0; i < n; ++i) {
        scanf("%d %d", &u, &k);
        u--;
        for (j = 0; j < k; j++) {
            scanf("%d", &v);
            v--;
            M[u][v] = 1;
        }
    }

    dfs();

    return 0;
}

C++: #include<iostream>
#include<vector>
#include<queue>
#include"print_vec.h"

using namespace std;

vector<vector<int>> adjacent;
vector<pair<int, int>> ans;
vector<bool>checked;

//?????????is????????????
int dfs(int now,int time = 1) {
	cout << now << endl;
	ans[now].first = time;
	checked[now] = true;
	for (int i = 0; i < adjacent[now].size(); i++) {
		if (!checked[adjacent[now][i]]) {
			time = dfs(adjacent[now][i], time + 1);
		}
	}
	ans[now].second = time+1;
	return time + 1;
}

int main() {
	int n;
	cin >> n;
	adjacent = vector<vector<int>>(n);
	checked = vector<bool>(n, false);
	ans.resize(n);

	for (int i = 0; i < n; i++) {
		int u, k;
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			int v;
			cin >> v;
			adjacent[u - 1].push_back(v-1);
		}
	}

	dfs(0, 1);
	
	for (int i = 0; i < n; i++) {
		cout << i + 1 << " " << ans[i].first << " " << ans[i].second << endl;
	}

}

C++: #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>
#define mop 1000000007

using namespace std;

static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int m[101][101] = {};
int nt[101] = {};
int n;
int color[101] = {};
int d[101] = {};
int f[101] = {};
int tt = 0;

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

void dfs_visit(int r){
    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{
            S.pop();
            color[u] = BLACK;
            f[u] = ++tt;
        }
    }
}

void dfs(){

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

int main() {
    
    cin >> n;
    for (int u=1;u<=n;u++){
        nt[u] = 1;
    }
    for (int i=1;i<=n;i++){
        int x,k;
        cin >> x >> k;
        for (int j=1;j<=k;j++){
            int p;
            cin >> p;
            m[i][p] = 1;
        }
    }
    dfs();

}

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

const int MAX = 105;
int n;
int am[MAX][MAX];
int d[MAX], f[MAX], t, color[MAX], nt[MAX];

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

void dfs_visit(int r) {
  stack<int> S;
  S.push(r);
  color[r] = 1;
  d[r] = ++t;

  while (!S.empty()) {
    int u = S.top();
    int v = next(u);
    if (v != -1) {
      if (color[v] == 0) {
      color[v] = 1;
      d[v] = ++t;
      S.push(v);
      }
    } else {
    S.pop();
    color[u] = 2;
    f[u] = ++t;
    }
  }
}

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

  for (int u = 0; u < n; u++) {
    if (color[u] == 0) dfs_visit(u);
  }

  for (int i = 0; i < n; i++) {
    cout << i + 1 << " " << d[i] << " " << f[i] << endl;
  }
  return 0;
}