#include <bits/stdc++.h>

using namespace std;
ifstream in("sortare.in");
ofstream out("sortare.out");
int n,m;
vector<int> v[50005];
stack <int> s;
void citire()
{
    int i,x,y;
    in>>n>>m;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
}
int dfs(int x)
{
    for(auto w:v[x])
    {
        dfs(w);
    }
    s.push(x);
}
int main()
{
    citire();
    dfs(1);
    while(!s.empty())
    {
        out<<s.top()<<" ";
        s.pop();
    }
    return 0;
}