#include <iostream>
#include <vector>

using namespace std;

int n,m,poz[50010],i,j,nr;
bool use[50010];

vector <int> v[50010];

void dfs(int x)
{
    use[x]=1;
    for (int i=0; i<v[x].size(); i++)
        if (!use[v[x][i]])
        dfs(v[x][i]);
    poz[++nr]=x;
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    cin>>n>>m;
    for (i=1; i<=m; i++)
    {
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
    }
    for (i=1; i<=n; i++)
    if (!use[i])
        dfs(i);
    for (i=nr; i; i--)
        cout<<poz[i]<<' ';
    return 0;
}