#include <cstdio>
#include <vector>
#include <bitset>

using namespace std;

const int nmx = 50002;

int n,m;
vector <int> g[nmx],Sort;
bitset <nmx> viz;

void citire(){
    scanf("%d %d", &n, &m);
    int nod1,nod2;
    for(int i = 1; i <= m; ++i){
        scanf("%d %d", &nod1, &nod2);
        g[nod1].push_back(nod2);
    }
}

void dfs(int nod){
    viz[nod] = true;
    for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        if(not viz[*it])
           dfs(*it);
    Sort.push_back(nod);
}

int main(){
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    citire();
    for(int i = 1; i <= n; ++i)
        if(not viz[i])
            dfs(i);
    for(vector<int>::reverse_iterator it = Sort.rbegin(); it != Sort.rend(); ++it)
        printf("%d ", *it);
    return 0;
}