using namespace std;
#include<cstdio>
#include<vector>
#define Nm (1<<16)
char Viz[Nm];
int A[Nm],n,k;
vector<int> G[Nm];

void read()
{
    int m,x,y;
    
    freopen("sortaret.in","r",stdin);
    scanf("%d%d",&n,&m);
    while(m--)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
}

void DFS(int x)
{
    vector<int>::iterator it;

    Viz[x]=1;
    for(it=G[x].begin();it!=G[x].end();++it)
        if(!Viz[*it])
            DFS(*it);
    A[k++]=x;
}

void solve()
{
    int i;

    for(i=1;i<=n;++i)
        if(!Viz[i])
            DFS(i);
}

void write()
{
    int i;

    freopen("sortaret.out","w",stdout);
    for(i=n-1;i;--i)
        printf("%d ",A[i]);
    printf("%d\n",A[i]);
}

int main()
{
    read();
    solve();
    write();
    return 0;
}