#include <cstdio>
#include <vector>

using namespace std;
int n,m,ns;
vector<int> g[50005];
int color[50005];
int sol[50005];

void read()
{
    int a,b;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
    }
}

void dfs(int k)
{
    vector<int>::iterator it;
    color[k]=1;
    for(it=g[k].begin();it!=g[k].end();++it)
        if(!color[*it])
            dfs(*it);
    sol[++ns]=k;
}

void sortop()
{
    for(int i=1;i<=n;++i)
        if(!color[i])
            dfs(i);
    for(int i=n;i;--i)
        printf("%d ",sol[i]);
    printf("\n");
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    read();
    sortop();
    return 0;
}