Go: package main

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

var N int
var A [][]int
var t int
var color, d, f []int

const (
	WHITE = iota
	GRAY
	BLACK
)

func dfsVisit(u int) {
	color[u] = GRAY
	t ++
	d[u] = t
	for v:=0; v<N; v++ {
		if A[u][v] == 0 {
			continue
		}
		if color[v] == WHITE {
			dfsVisit(v)
		}
	}
	color[u] = BLACK
	t++
	f[u] = t
}

func dfs() {
	for u:=0; u<N; u++ {
		if color[u] == WHITE {
			dfsVisit(u)
		}
	}
	for u:=0; u<N; u++{
		fmt.Printf("%d %d %d\n", u+1, d[u], f[u])
	}
}


func nextInt(scanner *bufio.Scanner) int {
	scanner.Scan()
	num, _ := strconv.Atoi(scanner.Text())
	return num
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	N = nextInt(scanner)
	color = make([]int, N)
	d = make([]int, N)
	f = make([]int, N)
	A = make([][]int, N)
	for i:=0; i<N; i++{
		A[i] = make([]int, N)
	}
	for i:=0; i<N; i++{
		index := nextInt(scanner) - 1
		cnt := nextInt(scanner)
		for j:=0; j<cnt; j++ {
			v := nextInt(scanner) - 1
			A[index][v] = 1
		}
	}
	dfs()
}

C++: #include <vector>
#include <cmath>
#include <iostream>
#include <algorithm>

int n;
int time_count = 0;
std::vector<std::pair<int, int>> times;
std::vector<std::vector<int>> vec;

void dfs(int id) {
    if (times[id-1].first == -1) {
        times[id-1].first = ++time_count; 
        for (int i = 1; i <= n; i++) {
            if (vec[id][i] == 1 && times[i-1].first == -1) {
                dfs(i);
            }
        }
        times[id-1].second = ++time_count;
    }
}

int main() {
    std::cin >> n;
    vec.assign(n+1, std::vector<int>(n+1, 0));
    for (int i = 0; i < n; i++) {
        times.push_back(std::make_pair(-1, -1));
    }
    for (int i = 0; i < n; i++) {
        int id, num, d;
        std::cin >> id >> num;
        for (int p = 0; p < num; p++) {
            std::cin >> d;
            vec[id][d] = 1;
        }
    }
    for (int i = 1; i <= n; i++) {
        dfs(i);
    }
    
    for (int i = 0; i < n; i++) {
        std::cout << i+1 << " " << times[i].first << " " << times[i].second << std::endl;
    }
}

C++: #include<iostream>
#include<vector>
#define NIL -1
using namespace std;

void DFS(int id, const vector<vector<int> >& a,
          vector<int>& find, vector<int>& finish){
    static int t = 1;
    if (find[id] != NIL) return;
    find[id] = t++;
    for (int i = 0; i < a[id].size(); i++) {
        DFS(a[id][i], a, find, finish);
    }
    finish[id] = t++;
}

int main(){
    int n;
    cin >> n;
    vector<vector<int> > a(n + 1);
    for (int i = 0; i < n; i++) {
        int u, k;
        cin >> u >> k;
        for (int j = 0; j < k; j++) {
            int v;
            cin >> v;
            a[u].push_back(v);
        }
    }
    vector<int> find(n + 1, NIL);
    vector<int> finish(n + 1, NIL);
    for (int i = 1; i <= n; i++) {
        DFS(i, a, find, finish);
    }
    for (int i = 1; i <= n; i++) {
        cout << i << " " << find[i] << " " << finish[i] << endl;
    }

    return 0;
}

C++: //#define _GLIBCXX_DEBUG

#include"bits/stdc++.h"
using namespace std;

//loops
#define REP(i,n) for(int i=0;i<(ll)(n);i++)
#define REPD(i,n) for(int i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(int i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(int i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(int i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)

//bitsearch
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1<<n); ++bit)
#define isOne(bit, i) bit & (1<<i)


//arrays
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define add push_back


#define remove_unique(v) v.erase(unique(ALL(v)), v.end())

//pair
#define fir first
#define sec second

//types
#define ll long long
#define vec vector
#define cord2d pair<int,int>
//UNCOMMENT WHEN NEEDED
//#define int ll

//input
template <class T> T get(){ T s; cin >> s; return(s);}
#define gi get<int>()
#define gs get<string>()

template <class T> vector<T> getv(int n) { vec<T> v(n); REP(i, n) cin >> v[i]; return v; }
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)

//output
void print(int a){ cout << a << endl; }
void print(long long a){ cout << a << endl; }
void print(string a){ cout << a << endl; }
void print(char a){ cout << a << endl; }
void print(double a){ cout << a << endl; }
void print(double a, int dig){ cout << std::setprecision(dig) << a << endl; }

template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}

template <class T = int>
void print(vec<T> v){ cout << v << endl; }

template <class T = int>
void print2dVec(vec<vec<T>> v2d){for(vec<T> v: v2d) {print(v);}}

void YesNo1(bool i = true){ return print(i?"Yes":"No"); }
void YESNO2(bool i = true){ return print(i?"YES":"NO"); }

//debug output
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") { cout << string("          ", nest) << before; print(var); }

//name replacement
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__

//bool lambdas
#define lamb(exp) [](auto i){return exp;}
#define isEven [](int i){return i % 2 == 0;}
#define isOdd [](int i){return i % 2 != 0;}

//constants
const ll INF = 1e18;
const int MOD = 10000007;

//maths
int factorial(int k){ int sum = 1; for (int i = 1; i <= k; ++i) { sum *= i; } return sum; }
int gcd(int a, int b) {
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

////////////////////

// 深さ優先探索

void dfs(vec<vec<int>> &G, int v, int &count, vec<pair<int,int>> &verts, vec<bool> &seen) {
    seen[v] = true;
    int enterCount = count;
    count++;

    // v から行ける各頂点 next_v について
    for (auto next_v : G[v]) {
        if (!seen[next_v]) {
            dfs(G, next_v, count, verts, seen); // 再帰的に探索
            count++;
        }
    }
    verts[v] = make_pair(enterCount, count);
}

void Main() {
    //code here
    int n = gi;
    vec<vec<int>> graph(n);
    vec<pair<int,int>> verts(n);
    vec<bool> seen(n);
    REP(i, n) {
        int z = gi;
        int nextAmount = gi;
        vec<int> nexts;
        REP(j, nextAmount) {
            nexts.add(gi - 1);
        }
        graph[i] = nexts;
    }

    int count = 1;
    while(find(ALL(seen), false) != seen.end()) {
        //int target = (int) (find(ALL(seen), false) - seen.begin());
        dfs(graph, (int) (find(ALL(seen), false) - seen.begin()), count, verts, seen);
        count ++;
    }
    int i = 1;
    for (pair<int,int> v: verts) {
        cout << i << " " << v.first << " " << v.second << endl;
        i++;
    }
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Main();
}

C++: #include <iostream>
#include <cstring>
#include <cstdlib>
#include <sstream>
#include <stack>
#include <queue>
#include <list>
#include <stdio.h>
#include <algorithm>
#define MAX 100000
using namespace std;
typedef long long ll;
int map[255][255];
int f[255],d[255],time;
bool vis[255];
void dfs(int n,int u)
{
	if(vis[u]) return;
	vis[u]=true;
	d[u]=++time;
	for(int i=1;i<=n;i++)
	{
		if(map[u][i]) dfs(n,i);
	}
	f[u]=++time;
	return; 
}
int main()
{	
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			map[i][j]=0;
		}
	for(int i=0;i<n;i++)
	{
		int cur,k,u;
		cin>>cur>>k;
		while(k--)
		{
			cin>>u;
			map[cur][u]=1;
		}
	}
	for(int i=1;i<=n;i++)
	{
		vis[i]=false;
	}
	dfs(n,1);
	for(int i=1;i<=n;i++)
	{
		cout<<i<<" "<<d[i]<<" "<<f[i]<<endl;
	}
	return 0;
}