#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> G[50005];
vector <int> ans;
int n,m,i,x,y;
bool used[50005];
void dfs(int nod)
{
    used[nod]=true;
    for (int j=0; j<G[nod].size(); j++) if (!used[G[nod][j]]) dfs(G[nod][j]);
    ans.push_back(nod);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d",&x,&y);
        G[x].push_back(y);
    }
    for (i=1; i<=n; i++) if (!used[i]) dfs(i);
    while (!ans.empty())
    {
        printf("%d ",ans.back());
        ans.pop_back();
    }
    return 0;
}