#include <bits/stdc++.h>

using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
int n,m,x,y,i,cnt;
vector <int> v[5005];
map <int, int>g;
queue <int> q;
void bfs (int nod,int nr)
{
   q.push(nod);
   g[nod]=nr;
   while (!q.empty())
        {
            nod=q.front();
            fout<<nod<<" ";
            for (int i: v[nod])
                if (g[nod]==0)
                    {
                        g[nod]=nr;
                        q.push(nod);
                    }
            q.pop();
        }
}
int main()
{
    fin>>n>>m;
    for (i=1;i<=m;i++)
        {
            fin>>x>>y;
            v[x].push_back(y);
        }
    for (i=1;i<=n;i++)
        if (g[i]==0)
            {
                //cout<<i<<" ";
                cnt++;
                bfs(i,cnt);
            }
    return 0;
}