Description：

Solution：

Code：

#include<bits/stdc++.h>

using namespace std;

int n,m;

#define MAXN 100010

struct edges

{

	int u,v,w;

}es[MAXN];

struct edge

{

	int to,nxt;

}e[MAXN << 1];

int edgenum = 0;

int lin[MAXN] = {0};

int ind[MAXN];

void add(int a,int b)

{

	++ind[b];

	e[++edgenum] = (edge){b,lin[a]};lin[a] = edgenum;

	return;

}

bool vis[MAXN];

int id[MAXN],tot = 0;

bool check(int v)

{

	edgenum = 0;

	memset(lin,0,sizeof(lin));

	memset(ind,0,sizeof(ind));

	for(int i = 1;i <= m;++i)

		if(es[i].w > v)add(es[i].u,es[i].v);

	queue<int> q;

	for(int i = 1;i <= n;++i)

		if(ind[i] == 0)q.push(i);

	memset(vis,false,sizeof(vis));

	while(!q.empty())

	{

		int k = q.front();q.pop();

		vis[k] = true;id[k] = ++tot;

		for(int i = lin[k];i != 0;i = e[i].nxt)

			if((--ind[e[i].to]) == 0)q.push(e[i].to);

	}

	for(int i = 1;i <= n;++i)if(!vis[i])return false;

	return true;

}

int ans[MAXN];

void calc(int k)

{

	check(k);

	int cnt = 0;

	for(int i = 1;i <= m;++i)

	{

		if(id[es[i].u] > id[es[i].v])ans[++cnt] = i;

	}

	cout << k << " " << cnt << endl;

	for(int i = 1;i <= cnt;++i)printf("%d ",ans[i]);

	return;

}

int main()

{

	scanf("%d%d",&n,&m);

	for(int i = 1;i <= m;++i)

	{

		scanf("%d%d%d",&es[i].u,&es[i].v,&es[i].w);

	}

	int l = 0,r = 1000000000,mid;

	while(l < r)

	{

		mid = ((l + r) >> 1);

		if(check(mid))r = mid;

		else l = mid + 1;

	}

	calc(l);

	return 0;

}