#include <bits/stdc++.h>
#define Nmax 50005

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> mat[Nmax];
int n,m,x,y,p[Nmax],sol[Nmax],k;

void dfs(int nod)
{
    p[nod]=1;
    for(int i=0;i<mat[nod].size();i++)
    {
        int z=mat[nod][i];
        if(p[z]==0)
            dfs(z);
    }
    sol[++k]=nod;
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        mat[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        if(p[i]==0)
            dfs(i);
    }
    for(int i=k;i>=1;i--)
        fout<<sol[i]<<" ";
    return 0;
}