#include <fstream>
#include <cstdio>
#include<vector>

using namespace std;
bool viz[50001];
vector <int>G[50001];
int n,m,p,x,y,a[50001];
void dfs(int k)
{
    viz[k]=1;
    for (int i=0; i<G[k].size(); i++)
        if (viz[G[k][i]]==0)
        dfs(G[k][i]);
    a[++p]=k;
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i=1; i<=m; i++)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        if (viz[i]==0)
             dfs(i);
    for (int i=p; i>=1; i--)
        printf("%d ",a[i]);
    return 0;
}