//#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

vector<vector<int> > v;
int vf[50001];

void dfs(int h)
{
    out<<h<<' ';
    for(int i=0;! v[h].empty(); i++)
    {
        if(vf[v[h][i]]==1)
        {
            dfs(v[h][i]);
            vf[v[h][i]]--;
        }
        v[h].pop_back();
    }
}

int main()
{
    int n,m,i,j;

    in>>n>>m;

    v.resize(n+2);
    while(in>>i)
    {
        in>>j;
        v[i].push_back(j);
        vf[j]=1;
    }

    for(int i=1; i<=n; i++)
        if(! v[i].empty())
            dfs(i);

    return 0;
}