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

using namespace std;

vector<int>suc[50002];
queue<int>q;
int pred[50002];

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    
    int n,r,x,y,u;
    
    scanf("%d%d",&n,&r);
    
    for(int i=1;i<=r;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() )
    {
        u=q.front();
        for(int i=0;i<suc[u].size();i++)
        {
            if( pred[ suc[u][i] ] )
                pred[ suc[u][i] ]--;
            
            if( !pred[ suc[u][i] ] )
                q.push( suc[u][i] );
        }
        printf("%d ",u);
        q.pop();
    }
    printf("\n");
    return 0;
}