#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector<int>v[50005];
int f[50005],m,n,start;
void lee(int start)
{
    queue<int>q;
    q.push(start);
    cout<<start<<" ";
    while(q.size()>0)
    {
        int curent=q.front();
        q.pop();
        for(int i=0;i<v[curent].size();i++)
        {
            cout<<v[curent][i]<<" ";
            q.push(v[curent][i]);
        }
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        v[x].push_back(y);
        f[y]++;
    }
    for(int i=1;i<=n;i++)
    {
        if(f[i]==0)
        {
            start=i;
            break;
        }
    }
    lee(start);
    return 0;
}