#include<bits/stdc++.h>
#define ll long long
using namespace std;
class Edge
{
    public:
    ll u, v, cost;
    Edge(ll u,ll v,ll cost)
    {
        this->u=u;
        this->v=v;
        this->cost=cost;
    }
    void show()
    {
        cout<<u<<" "<<v<<" "<<cost<<endl;
    }
};
ll n, m, v,flg=0;
const ll INF = 1000000000;
vector<Edge>edges;
vector<vector<pair<ll,ll>>>graph(100005);
vector<ll> par(100005, -1);
set<ll>negedg;
vector<ll>vis(100005,0);
set<ll>ans;
void bellman(ll src,vector<ll>&d)
{
    d[src] = 0;
    int x;
    for (int i = 0; i < n; ++i) {
        x = -1;
        for (Edge e : edges)
                if (d[e.u]<INF && d[e.v] > d[e.u] + e.cost) {
                    d[e.v] = max(-INF, d[e.u] + e.cost);
                    par[e.v] = e.u;
                }
    }

    for (Edge e : edges)
                if (d[e.u]<INF && d[e.v] > d[e.u] + e.cost) {
                    d[e.v] = max(-INF, d[e.u] + e.cost);
                     ans.insert(src);
                }

}
void vout(vector<ll>&v,ll n)
{
    for(ll i=0;i<n;i++)
    {
        cout<<v[i]<<" ";
    }
    cout<<endl;
}
void reset(vector<ll>&v,ll n)
{
    for(int i=0;i<n;i++)
        vis[i]=0;
}
int main()
{
    ll x,y,wt;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        cin>>x>>y>>wt;
         Edge edg(x,y,wt);
         edges.push_back(edg);
         graph[x].push_back({y,wt});
    }
    for(ll i=1;i<=n;i++)
    {
       vector<ll> d(100005, INF);
      bellman(i,d);
    }
    for(auto z:ans)
        cout<<z<<" ";

}