n,m=map(int,input().split()) inf=float('inf') d=[[inf]*n for _ in range(n)] for _ in range(m): s,t,c=map(int,input().split()) d[s-1][t-1]=min(d[s-1][t-1],c) for i in range(n): d[i][i]=0 for k in range(n): for i in range(n): for j in range(n): d[i][j]=min(d[i][j],d[i][k]+d[k][j]) for i in range(n): ans=0 for j in range(n): if i!=j and d[i][j]