#include <cstdio>
#include <vector>
using namespace std;
int pred[50005];
vector<int>v[50005];
int p[50005];
int n;
int cnt;
int viz[100005];
void dfs(int m)
{
    viz[m]=1;
    int i;
        p[++cnt]=m;
    for(i=0;i<v[m].size();i++)
    {
        pred[v[m][i]]--;
        if(pred[v[m][i]]==0)dfs(v[m][i]);
    }

}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int  m , x, i, y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        pred[y]++;
        v[x].push_back(y);
    }

    for(i=1;i<=n;i++)
    {
        if(!pred[i]&&!viz[i])
        {
            dfs(i);
        }
    }
    for(i=1;i<=cnt;i++)
        printf("%d ",p[i]);
    return 0;
}