#include <cstdio>
#include <vector>
#define NMAX 50010
using namespace std;
int n,m,i,x,y;
vector <int> G[NMAX], sol;
bool ok[NMAX];

void dfs(int node)
{
    int s,x,i;
    ok[node]=true;
    s=G[node].size();
    for(i=0; i<s; ++i)
    {
        x=G[node][i];
        if(!ok[x])
            dfs(x);
    }
    sol.push_back(node);
}

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(!ok[i])
            dfs(i);
    while(!sol.empty())
    {
        printf("%d ",sol.back());
        sol.pop_back();
    }
    return 0;
}