#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m,x;
vector<int>L[50005];
int viz[50005],st[50005],top;



void DFS(int x)
{
    viz[x]=1;
    for(auto i:L[x])
        if(viz[i]==0)DFS(i);
    st[++top]=x;
}

int main()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(viz[i]==0)DFS(i);
    for(i=n;i>=1;i--)
        fout<<st[i]<<" ";
    return 0;
}