Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

var infty = 1000000000

type nodeKey int

type DirectedGraphNode struct {
	key       nodeKey
	adjacents []*DirectedGraphNode
	visited   bool
	d         int
	f         int
	parent    *DirectedGraphNode
}

type DirectedGraph struct {
	nodes []*DirectedGraphNode
}

func (g *DirectedGraph) setAdjacency(l, r nodeKey) {
	g.nodes[l].adjacents = append(g.nodes[l].adjacents, g.nodes[r])
}

func newDirectedGraph(nNodes int) *DirectedGraph {
	graph := DirectedGraph{}
	graph.nodes = make([]*DirectedGraphNode, nNodes)
	for iNodes := 0; iNodes < nNodes; iNodes++ {
		graph.nodes[iNodes] = &DirectedGraphNode{}
		graph.nodes[iNodes].key = nodeKey(iNodes)

		graph.nodes[iNodes].visited = false
		graph.nodes[iNodes].d = infty
		graph.nodes[iNodes].f = infty
		graph.nodes[iNodes].parent = nil
	}
	return &graph
}

type QueueEntry struct {
	node *DirectedGraphNode
	next *QueueEntry
}

type Queue struct {
	head, tail *QueueEntry
}

func (q *Queue) enqueue(node *DirectedGraphNode) {
	entry := QueueEntry{}
	entry.node = node

	if q.tail == nil {
		q.head = &entry
		q.tail = &entry
		return
	}

	q.tail.next = &entry
	q.tail = q.tail.next
}

func (q *Queue) dequeue() *QueueEntry {
	if q.head == nil {
		return nil
	}
	poped := q.head
	q.head = q.head.next
	if q.head == nil {
		q.tail = nil
	}
	return poped
}

func (q *Queue) isEmpty() bool {
	return q.head == nil
}

var time = 0

func fillDistancesByDepthFirstSearch(g *DirectedGraph) {
	for _, u := range g.nodes[1:] {
		if !u.visited {
			dfsVisit(g, u)
		}
	}
}

func dfsVisit(g *DirectedGraph, u *DirectedGraphNode) {
	time++
	u.d = time

	u.visited = true
	for _, v := range u.adjacents {
		if !v.visited {
			v.parent = u
			dfsVisit(g, v)
		}
	}
	time++
	u.f = time
}

func main() {
	scanner.Split(bufio.ScanWords)

	nNodes := nextInt()
	g := newDirectedGraph(nNodes + 1)

	for iNode := 0; iNode < nNodes; iNode++ {
		nodeKeyLeft := nodeKey(nextInt())
		nAdj := nextInt()
		for iAdj := 0; iAdj < nAdj; iAdj++ {
			nodeKeyRight := nodeKey(nextInt())
			g.setAdjacency(nodeKeyLeft, nodeKeyRight)
		}
	}

	fillDistancesByDepthFirstSearch(g)

	for iNode := 1; iNode <= nNodes; iNode++ {
		node := g.nodes[iNode]
		fmt.Println(node.key, node.d, node.f)
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;

vector<vector<int>> G(101);
int d[101] = {}, f[101] = {};

void dfs(int from, int& time) {
    if (d[from] == -1) {
        time++;
        d[from] = time;

        for (auto v: G[from]) dfs(v, time);

        time++;
        f[from] = time;
    }
}

int main() {
    int N;
    cin >> N;
    
    rep(i, N) {
        int u, k, vj;
        cin >> u >> k;
        rep(j, k) {
            cin >> vj;
            G[u].push_back(vj);
        }
    }

    int time=0;
    rep(i, N+1) d[i] = -1;
    for (int i=1; i<=N; i++) {
        if (d[i] == -1) dfs(i, time);
    }
    
    for (int i=1; i<=N; i++) {
        cout << i << " " << d[i] << " " << f[i] << endl;
    }

    return 0;
}

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

static const int DFS_VISIT_NO   = 0;
static const int DFS_VISIT_NOW  = 1;
static const int DFS_VISIT_DONE = 2;

static int g_time = 0;
static int g_setime[100][2] = {0};

void DfsVisit(vector<int> &graph, int node, vector<int> &state)
{
    int i;
    int nnum;
    int target;

    ++g_time;
    g_setime[node][0] = g_time;

    state[node] = DFS_VISIT_NOW;
    
    nnum = graph[node].size();

    for (i = 0; i < nnum; i++) {
        target = graph[node][i];
        if (state[target] != DFS_VISIT_DONE) {
            DfsVisit(graph, target, state);
        }
    }

    state[node] = DFS_VISIT_DONE;

    ++g_time;
    g_setime[node][1] = g_time;

    return;
}


void DFS(vector<int> &graph, int num)
{
    int i;
    vector<int> state;

    for (i = 0; i < num; i++) {
        state[i] = DFS_VISIT_NO;
    }

    for (i = 0; i < num; i++) {
        if (state[i] == DFS_VISIT_NO) {
            DfsVisit(graph, num, i, state);
        }
    }

    for (i = 0; i < num; i++) {
        printf("%d %d %d\n", i+1, g_setime[i][0], g_setime[i][1]);
    }

    return;
}

int main(void)
{
    int i, j;
    int target, tnum, node;
    int num;

    scanf("%d", &num);
    vector<int> graph[num];

    for (i = 0; i < num; i++) {
        scanf("%d" "%d", &target, &tnum);
        --target;
        for (j = 0; j < tnum; j++) {
            scanf("%d", &node);
            --node;
            graph[target].push_back(node);
        }
    }

    DFS(graph, num);
}

C++: #include <iostream>
#include <algorithm>
#include <stack>


using namespace std;


stack<int> visiting;

#define MAX 100
bool adj[MAX + 2][MAX + 2];
int d[MAX + 1], f[MAX + 1];
bool discovered[MAX + 1];
int tt, n;


void dfs(int v)
{
    visiting.push(v);
    discovered[v] = true;
    d[v] = ++tt;

    while (!visiting.empty()) {
        int now = visiting.top();
        int i;
        for (i = 1; i <= n; i++) {
            if (adj[now][i] && !discovered[i])
                break;
        }

        if (!discovered[i] && i <= n) {
            d[i] = ++tt;
            visiting.push(i);
            discovered[i] = true;
        } else {
            f[now] = ++tt;
            visiting.pop();
        }
    }
}


int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int id, k;
        cin >> id >> k;
        for (int j = 0; j < k; j++) {
            int v;
            cin >> v;
            adj[id][v] = true;
        }

        discovered[i] = false;
    }

    for (int i = 1; i <= n; i++)
        if (!discovered[i])
            dfs(i);


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

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int n;
bool ok[10005];
int d[10005];
int f[10005];
vector<int> e[10005];
int step=0;
void dfs(int i){
	ok[i]=1;
	step++;
	d[i]=step;
	for(int j=0;j<e[i].size();j++)
		if(!ok[e[i][j]])
			dfs(e[i][j]);
	step++;
	f[i]=step;
}
void solve(){
	for(int i=1;i<=n;i++)if(!ok[i])dfs(i);
	for(int i=1;i<=n;i++)
		cout<<i<<' '<<d[i]<<' '<<f[i]<<"\n";
}
int main(){
//	freopen("a.txt","r",stdin);
	cin>>n;
	int u,k,v;
	for(int i=1;i<=n;i++){
		cin>>u>>k;
		for(int j=0;j<k;j++)cin>>v,e[u].push_back(v);
	}
	solve();
	return 0;
}

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

using namespace std;

struct Edge
{
	int to;
};

vector<vector<int>> DFS(vector<vector<Edge>>& G)
{
	int timecounter = 0;
	vector<vector<int>> result;
	result = vector<vector<int>>(2, vector<int>(G.size(), 0));
	vector<int> prev(G.size(),0);
	
	for(int i = 0; i < G.size(); i++){
		int next = i + 1;
		while(result[1][i] == 0){
			int tmp;
			if(result[0][next - 1] == 0){
				timecounter += 1;	
				result[0][next - 1] = timecounter;
			}

			if(G[next - 1].empty() || result[0][G[next - 1].begin()->to - 1]){
				if(result[1][next - 1] == 0){
					timecounter += 1;
					result[1][next - 1] = timecounter;
				}
				next = prev[next - 1];
			}else{
				tmp = G[next - 1].begin()->to;
				G[next - 1].erase(G[next - 1].begin());
				if(tmp != next)
					prev[tmp - 1] = next;
				next = tmp;
			}
			//cout << next << endl;
		}
	}
	return result;
}

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

	vector<vector<Edge>> AdjList(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;
			AdjList[i].push_back(Edge{v});
		}
	}

	vector<vector<int>> timestump = DFS(AdjList);
	
	for(int i = 0; i < AdjList.size(); i++){
		cout << i + 1 << " " << timestump[0][i] << " " << timestump[1][i] << endl;
	}
	return 0;
}