Go: package main

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	nVerts := scanInt(sc)
	graph := make([][]int, nVerts+1)

	for i := 0; i < nVerts; i++ {
		u := scanInt(sc)
		nDegrees := scanInt(sc)

		graph[u] = make([]int, nDegrees)
		for d := 0; d < nDegrees; d++ {
			graph[u][d] = scanInt(sc)
		}
	}

	starts := make([]int, nVerts+1)
	ends := make([]int, nVerts+1)
	time := 1

	var dfs func(u int)
	dfs = func(u int) {
		if starts[u] > 0 {
			return
		}

		starts[u] = time
		time += 1

		for _, v := range graph[u] {
			dfs(v)
		}

		ends[u] = time
		time += 1
	}

	for i := 1; i <= nVerts; i++ {
		dfs(i)
	}

	w := bufio.NewWriter(os.Stdout)
	for i := 1; i <= nVerts; i++ {
		fmt.Fprintf(w, "%d %d %d\n", i, starts[i], ends[i])
	}
	w.Flush()
}

func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

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>;

const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;
const int MAX = 103;
int G[MAX][MAX];
int color[MAX];
int nt[MAX], d[MAX], f[MAX];
int tt, n;

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

void dfs_visit(int r) {
  memset(nt, 0, sizeof(nt));
  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() {
  memset(color, WHITE, sizeof(color));
  memset(nt, 0, sizeof(nt));
  tt = 0;

  rep(u,n) {
    if (color[u] == WHITE) dfs_visit(u);
  }
  rep(i,n) {
    cout << i+1 << ' ' << d[i] << ' ' << f[i] << endl;
  }
}

int main() {

  cin >> n;
  rep(i,n) memset(G[i], WHITE, sizeof(G[i])); // init
  int u, k;
  rep(i,n) {
    cin >> u >> k;
    rep(j,k) {
      int t;
      cin >> t;
      G[i][t-1] = 1;
    }
  }

  dfs();

  return 0;
}

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

vector<vector<int>> g;
vector<int> f,d;
vector<bool> seen;
int tim = 1;

void dfs(int now){
  seen[now] = true;
  d[now] = tim;
  tim++;
  
  for(int next: g[now]){
    if(seen[next]){
      continue;
    }
    dfs(next);
  }
  f[now] = tim;
  tim++;
}

int main(){
  int n;
  cin >> n;
  g = vector<vector<int>>(n);
  f = d = vector<int>(n);
  seen = vector<bool>(n,false);

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

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

C++: #include<bits/stdc++.h>
#define ll long long int
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)

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

void dfs_visit(int u) {
  color[u] = gray;
  d[u] = ++tt;
  REP(v, n) {
    if ( M[u][v] == 0) continue;
    if ( color[v] == white ) {
      dfs_visit(v);
    }
  }
  color[u] = black;
  f[u] = ++tt;
}

void dfs() {
  REP(u, n) color[u] = white;
  tt = 0;

  REP(u, n) {
    if ( color[u] == white ) dfs_visit(u);
  }
  REP(u, n) {
    cout << u + 1 << " " << d[u] << " " << f[u] << endl;
  }
}

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

  cin >> n;
  REP(i, n) {
    REP(j, n) {
      M[i][j] = 0;
    }
  }

  REP(i, n) {
    cin >> u >> k;
    u--;
    REP(j, k) {
      cin >> v;
      v--;
      M[u][v] = 1;
    }
  }

  dfs();

  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++) {
		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[v] = BLACK;
		   S.pop();
		   f[v] = ++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;
	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 <bits/stdc++.h>
using namespace std;
// stack

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

  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;
#ifdef ENABLE_DEBUG_OUTPUT
#define DEBUG_LOG(s) cout << s << endl;
#else
#define DEBUG_LOG(s) void();
#endif

int t = 1;
vector<vector<bool>> g;
vector<int> d;
vector<int> f;

void dfs(const int s) {
    if(d[s] != -1) return;
    d[s] = t++;

    for (auto i = 0; i < (int)g[s].size(); i++) {
        if(g[s][i]) dfs(i);
    }

    f[s] = t++;
}

int main(){
    int n;
    cin >> n;

    g.assign(n, vector<bool>(n, false));
    for (auto i = 0; i < n; i++) {
        int u, k; cin >> u >> k;
        for (auto j = 0; j < k; j++) {
            int v; cin >> v;
            g[u - 1][v - 1] = true;
        }
    }

    d.assign(n, -1);
    f.assign(n, -1);
    for (auto i = 0; i < n; i++) {
        if(d[i] == -1) dfs(i);
    }

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

    return 0;
}