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

using namespace std;

queue<int> q;
vector<int> mat[50002];
int pred[50002];
int n,m;

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