#include<cstdio>
#include<vector>
#include<queue>

using namespace std;
int n,m,x,y;
int pred[50005];
vector<int> suc[50005];
queue<int> q;

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        pred[y]++;
        suc[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(pred[i]==0)
            q.push(i);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        printf("%d ",x);
        for(int j=0;j<suc[x].size();j++)
        {
                pred[suc[x][j]]--;
                if(pred[suc[x][j]]==0)
                    q.push(suc[x][j]);
        }
    }
    return 0;
}