#include <cstdio>
#include <vector>
#include <bitset>
#define pb push_back
using namespace std;

const int nmx = 50002;

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

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

int main(){
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

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

    for(int i = 1; i <= n; ++i)
        if(not viz[i])
            dfs(i);

    for(int i = n; i; --i)
        printf("%d ", af[i]);

    return 0;
}