#include <cstdio>
#include <vector>
#include <algorithm>

#define NMax 50005
using namespace std;

int viz[NMax];
int n,m,x,y;
vector<int> vecini[NMax];

void dfs(int k){
    viz[k] = 1;
    printf("%d ",k);
    for(int i = 0; i < vecini[k].size(); ++i){
        if(!viz[vecini[k][i]]){
            dfs(vecini[k][i]);
        }
    }
}
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);
        vecini[x].push_back(y);
    }
    for(int i = 1; i <= n; i++){
        sort(vecini[i].begin(),vecini[i].end());
    }
    int ok = 1;
    while(ok){
        for(int i = 1; i <= n; ++i){
            if(!viz[i]){
                ok = 0;
                dfs(i);
                break;
            }
        }
    }
    return 0;
}