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)
	dfs(&g, &d, &f, 1, 1)

	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 <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int ans=0,a[100],b[100];
bool niko[100];
vector<vector<int> > v(100);
void dfs(int n){
	if(a[n])return;
	a[n]=++ans;
	for(auto& i:v[n])dfs(i);
	b[n]=++ans;
	return;
}
int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    memset(a,0,sizeof(a));
    int n;
    cin>>n;
    int k,c;
    for(int i=0;i<n;i++){
    	cin>>c>>k;
    	for(int j=0;j<k;j++){
    		cin>>c;
    		v[i].pb(--c);
    	}
    }
    for(int i=0;i<n;i++)sort(be(v[i]));
    for(int i=0;i<n;i++)dfs(i);
    for(int i=0;i<n;i++){
    	cout <<i+1<<" "<<a[i]<<" "<<b[i]<<endl; 
    }
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
using namespace std;

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

int n;
int M[110][110] = {};
int color[110];
int elapse = 0;
int d[110];
int f[110];

void dfs(int u) {
  color[u] = GRAY;
  d[u] = ++elapse;
  rep(v, n) {
    if (M[u][v] && color[v] == WHITE) dfs(v);
  }
  color[u] = BLACK;
  f[u] = ++elapse;
}

void dfs_init() {
  rep(i, n) color[i] = WHITE;
  rep(i, n) {
    if (color[i] == WHITE) dfs(i);
  }
}

int main() {
  cin >> n;
  rep(i, n) {
    int id, deg;
    cin >> id >> deg;
    --id;    // 0-indexedに直す
    rep(j, deg) {
      int v;
      cin >> v;
      --v;    // 0-indexedに直す
      ++M[id][v];
    }
  }
  dfs_init();
  rep(i, n) {
    cout << i + 1 << " " << d[i] << " " << f[i] << endl;
  }
  return 0;
}

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

void dfs(int cur);
int df[100][2]={};
bool dc[100]={};
bool adj[100][100]={};//初期化を忘れない
int n,u,v,k;
int t = 1;
queue<int> q;

int main(){
  cin >> n;
  for (int i=0; i<n; i++){
    cin >> u >> k;
    for (int j=0; j<k; j++){
      cin >> v;
      adj[u-1][v-1] = true;
    }
  }
  
  q.push(0);
  dfs(0);
  
  
  for (int i=0; i<n; i++)
    cout << i+1 << " " << df[i][0] << " " << df[i][1] << endl;

}

void dfs(int cur){
  q.pop();

  if (dc[cur] != true){

    dc[cur] = true;
    q.push(cur);
    df[cur][0] = t;
    t += 1;
    for (int i=0; i<n; i++){
      if (adj[cur][i] && !dc[i]){
	dfs(i);
      }
    }
    df[cur][1] = t; 
    t += 1;
    
  }

  if (!q.empty())
    dfs(q.front());
  
}

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++) {
		nt[u] = v + 1;
		if(M[u][v] == 1) 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 {
		   color[u] = BLACK;
		   S.pop();
		   f[u] = ++tt;
		}
	} 
}


void dfs() {
	for(int i = 0; i < n; i++) {
	     color[i] = WHITE;
	}
	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() {
	int n, k , u, v;
	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;
}

C++: #include<cstdio>
#include<stack>
using namespace std;
static const int MAXN=101;
static const int INF=(1<<21);
int main(){
	int m[MAXN][MAXN],n,u,k,v,i,j,first[MAXN]={},second[MAXN]={},l,c=1,o,z=2;
	stack<int> s;
	bool used[MAXN]={};
	scanf("%d",&n);
	for(i=1;i<n+1;i++){
		for(j=1;j<n+1;j++){
			m[i][j]=INF;
		}
	}
	for(i=0;i<n;i++){
		scanf("%d %d",&u,&k);
		for(j=0;j<k;j++){
			scanf("%d",&v);
			m[u][v]=1;
		}
	}
	s.push(1);
	used[1]=true;
	while(1){
		l=s.top();
		if(first[l]==0){
			first[l]=c;
		}
		o=0;
		for(i=1;i<n+1;i++){
			if(m[l][i]==1&&used[i]==false){
				s.push(i);
				o=1;
				used[i]=true;
				break;
			}
		}
		c++;
		if(o==0){
			second[l]=c;
			s.pop();
		}
		if(s.empty()){
			z=0;
			for(i=1;i<n+1;i++){
				if(used[i]==false){
					s.push(i);
					z=1;
					used[i]=true;
					break;
				}
			}
		}
		if(z==0){
			break;
		}
		if(z==1){
			c++;
			z=2;
		}
	}
	for(i=1;i<n+1;i++){
		printf("%d %d %d\n",i,first[i],second[i]);
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(n) begin(n), end(n)
using ll = long long;
using namespace std;

bool dfs(vector<vector<int>> &gr, vector<pair<int, int>> &ans, int &t, int now, vector<bool> &chk){
  static int chkc = 0;
  chk.at(now) = true;
  chkc++;
  ans.at(now).first = t;
  for(auto i : gr.at(now)){
    if(chk.at(i) == true) continue;
    t++;
    dfs(gr, ans, t, i, chk);
  }
  t++;
  ans.at(now).second = t;
  // cerr << now << " " << chkc << endl;
  if(chkc == ans.size()) return true;
  else return false;
}

int main(){
  int n;
  cin >> n;
  vector<vector<int>> gr(n, vector<int>());
  // vector<bool> stc(n, false);
  vector<pair<int, int>> ans(n);
  rep(i, n){
    int aa, deg;
    cin >> aa >> deg;
    rep(j, deg){
      int a;
      cin >> a;
      a--;
      // stc.at(a) = true;
      gr.at(i).push_back(a);
    }
  }
  int t = 0;
  vector<bool> chk(n, false);
  while(1){
    int st = -1;
    rep(i, n){
      if(chk.at(i) == false){
        st = i;
        break;
      }
    }
    if(st == -1){
      cerr << "f" << endl;
      exit(1);
    }
    t++;
    bool end = dfs(gr, ans, t, st, chk);
    if(end == true) break;
  }
  rep(i, n){
    cout << i+1 << " " << ans.at(i).first << " " << ans.at(i).second << endl;
  }
  return 0;
}