Go: package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
	"strings"
)

const N = 100

const (
	WHITE = iota
	GRAY
	BLACK
)

type Graph struct {
	M               [N][N]int
	color, d, f, nt [N]int
	tt              int
}

func (g *Graph) next(u, n int) int {
	for v := g.nt[u]; v < n; v++ {
		g.nt[u] = v + 1
		if g.M[u][v] != 0 {
			return v
		}
	}
	return -1
}

func (g *Graph) dfsVisit(r, n int) {
	var S []int
	S = append([]int{r}, S...)
	g.color[r] = GRAY
	g.tt++
	g.d[r] = g.tt

	for len(S) != 0 {
		u := S[0]
		v := g.next(u, n)
		if v == -1 {
			S = S[1:]
			g.color[u] = BLACK
			g.tt++
			g.f[u] = g.tt
			continue
		}

		if g.color[v] != WHITE {
			continue
		}

		g.color[v] = GRAY
		g.tt++
		g.d[v] = g.tt
		S = append([]int{v}, S...)
	}
}

func (g *Graph) dfs(n int) string {
	for i := 0; i < n; i++ {
		g.color[i] = WHITE
	}
	g.tt = 0

	for u := 0; u < n; u++ {
		if g.color[u] == WHITE {
			g.dfsVisit(u, n)
		}
	}

	var out bytes.Buffer
	for i := 0; i < n; i++ {
		out.WriteString(fmt.Sprintf("%d %d %d\n", i+1, g.d[i], g.f[i]))
	}

	return strings.TrimRight(out.String(), "\n")
}

func answer(reader io.Reader) string {
	sc := bufio.NewScanner(reader)
	sc.Split(bufio.ScanWords)

	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())

	var g Graph
	for i := 0; i < n; i++ {
		sc.Scan()
		u, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		k, _ := strconv.Atoi(sc.Text())
		u--
		for j := 0; j < k; j++ {
			sc.Scan()
			v, _ := strconv.Atoi(sc.Text())
			v--
			g.M[u][v] = 1
		}
	}

	return g.dfs(n)
}

func main() {
	fmt.Println(answer(os.Stdin))
}

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);
void dfs_visit(int r);
void dfs();

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

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

C++: # include <iostream>

using namespace std;

struct Vertex
{
    int id, k, *adjcent, start, end;
    bool passed = false;
};

Vertex *vertexs;
int time_ = 0;

void DFS(int now)
{
    vertexs[now].passed = true;
    time_++;
    vertexs[now].start = time_;
    for(int i=0; i<vertexs[now].k; i++)
    {
        if(!vertexs[vertexs[now].adjcent[i]].passed) DFS(vertexs[now].adjcent[i]);
    }
    time_++;
    vertexs[now].end = time_;
}

int main()
{
    int n;
    scanf("%d", &n);
    vertexs = new Vertex[n+1];
    for(int i=1; i<=n; i++)
    {
        scanf("%d%d", &vertexs[i].id, &vertexs[i].k);
        vertexs[i].adjcent = new int[vertexs[i].k];
        for(int j=0; j<vertexs[i].k; j++)
        {
            scanf("%d", &vertexs[i].adjcent[j]);
        }
    }
    for(int i=1; i<=n; i++)
    {
        if(!vertexs[i].passed) DFS(vertexs[i].id);
    }
    for(int i=1; i<=n; i++) printf("%d %d %d\n", vertexs[i].id, vertexs[i].start, vertexs[i].end);

    return 0;
}

C++: #include <iostream>
#define N 110

int t = 1;

int d[N], f[N];
int A[N][N];

void Depth(int id, int n){
  d[id] = t;
  t++;
  for(int i=1; i<=n; i++){
    if(A[id][i] == 1 && d[i] == 0){
      Depth(i, n);
    }
  }
  f[id] = t;
  t++;
}



int main(){
  for(int i=0; i<N; i++){
    d[i]=f[i]=0;
    for(int j=0; j<N; j++){
      A[i][j]=0;
    }
  }
  int n;
  std::cin >> n;
  for(int i=0; i<n; i++){
    int u, k, v;
    std::cin >> u >> k;
    for(int i=0; i<k; i++){
      std::cin >> v;
      A[u][v]=1;
    }
  }
  for(int i=1; i<=n; i++){
    if(d[i] == 0 && f[i] == 0){ Depth(i, n); }
  }
  for(int i=1; i<=n; i++){
    std::cout << i << " " << d[i] << " " << f[i] << std::endl;
  }

  return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

vector<int> G[110];

int timer;
int d[110],f[110];

bool used[110];

void dfs(int x)
{
    used[x]=true;
    d[x]=++timer;

    for(int i=0;i<G[x].size();i++)
    {
        if(!used[G[x][i]])
        {
            dfs(G[x][i]);
        }
    }

    f[x]=++timer;
}


int main()
{

    int n;

    cin>>n;

    for(int i=0;i<n;i++)
    {
        int a,b,c;

        cin>>a>>b;

        for(int i=0;i<b;i++)
        {
            cin>>c;

            G[a].push_back(c);
        }
    }

    timer=0;
    memset(used,0,sizeof(used));

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

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

    return 0;
}

C++: #include <iostream>
#include <stack>
#define MAX 101
#define NIL -1

using namespace std;


int matrix[MAX][MAX] = {0};
int d[MAX], f[MAX];
int n, t;

void dfs();
void dfs_visit(int u);
int next(int u);

int main()
{
	cin >> n;
	
	for (int i = 0; i < n; i++)
	{
		int u, k, v;
		cin >> u >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> v;
			matrix[u][v] = 1;			
		}
	}
	
//显示邻接矩阵 
//	for (int i = 0; i < n; i++)
//	{
//		for (int j = 0; j < n; j++)
//		{
//			if(j) cout << ' ';
//			cout << matrix[i+1][j+1];		
//		}
//		cout << endl;
//	}
	
	
	dfs();
	
	
	for (int i = 1; i <= n; i++)
	{
		cout << i << ' ';
		cout << d[i] << ' ';	
		cout << f[i] << endl;
	}
} 



void dfs()
{	
	for (int i = 1; i <= n; i++)
	{
		if (d[i] == 0)
			dfs_visit(i);
	}
}



void dfs_visit(int u)
{

	stack<int> S;
	S.push(u);
	d[u] = ++t;
	
	while (!S.empty())
	{
		u = next(S.top());
		if (u)
		{
//			if (d[u] == 0)
			{
			d[u] = ++t;
			S.push(u); 				
			}
		}
		else
		{
			f[S.top()] = ++t;
			S.pop();
		}
		
	}
	
}


int next(int u)
{
	for (int i = 1; i <= n; i++)
	{
		if (matrix[u][i] != 0 && d[i] == 0)
			return i;
	}
	return 0;
}

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

struct TNode
{
	int Index;
	bool Visited;
	std::list<TNode*> Target;
	
	int ClockStart;
	int ClockEnd;
	
	TNode(int AIndex)
	: Index(AIndex), Visited(false), ClockStart(0), ClockEnd(0)
	{
	}
	
	void Visit(int& Clock)
	{
		if(Visited) return;
		Visited = true;
		ClockStart = Clock;
		++Clock;
		for(std::list<TNode*>::iterator It = Target.begin(); It != Target.end(); ++It){
			(*It)->Visit(Clock);
		}
		ClockEnd = Clock;
		++Clock;
	}
};

class TGraph
{
	std::vector<TNode*> FNodes;
public:
	TGraph(int Count)
	: FNodes(Count)
	{
		for(int i = 0; i < Count; ++i){
			FNodes[i] = new TNode(i + 1);
		}
	}
	
	~TGraph()
	{
		for(unsigned int i = 0; i < FNodes.size(); ++i){
			delete FNodes[i];
		}
	}
	
	void InputNode(int Index, int BranchCount)
	{
		for(int i = 0; i < BranchCount; ++i){
			int Target;
			std::cin >> Target;
			FNodes[Index - 1]->Target.push_back(FNodes[Target - 1]);
		}
	}
	
	void DepthFirstSearch()
	{
		int Clock = 1;
		for(unsigned int i = 0; i < FNodes.size(); ++i){
			FNodes[i]->Visit(Clock);
		}
	}
	
	void OutputClocks()const
	{
		for(unsigned int i = 0; i < FNodes.size(); ++i){
			std::cout << FNodes[i]->Index      << " "
			          << FNodes[i]->ClockStart << " "
			          << FNodes[i]->ClockEnd   << std::endl;
		}
	}
};

int main()
{
	int Count;
	std::cin >> Count;
	TGraph Graph(Count);
	for(int i = 0; i < Count; ++i){
		int Index;
		std::cin >> Index;
		int BranchCount;
		std::cin >> BranchCount;
		Graph.InputNode(Index, BranchCount);
	}
	Graph.DepthFirstSearch();
	Graph.OutputClocks();
	return 0;
}