#include<fstream>
#include<vector>
#include<algorithm>


using namespace std;

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

int n,m,i,x,y,viz[50004];
vector<int> g[50004],sol;


void dfs(int nod)
{
    viz[nod] = 1;
    for (int i = 0; i < g[nod].size(); i++)
        if (viz[ g[nod][i] ]) ; else
           dfs(g[nod][i]);
    sol.push_back(nod);
}

int main()
{
    cin >> n >> m;

    while (m--)
    {
        cin >> x >> y;
        g[x].push_back(y);
    }

    dfs(1);

    reverse(sol.begin(),sol.end());
    for (i=0;i<sol.size();i++)
        cout << sol[i] << ' ';

    return 0;
}