#include <bits/stdc++.h>

using namespace std;
int N,M;
const int Nmax = 60005;
vector<vector<int> > G;
bitset<Nmax> used;

void DFS(int k)
{
    used[k] = true;
    for(auto it : G[k])
        if(!used[it])
            DFS(it);
    printf("%d ",k);
}

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

    cin >> N >> M;
    G.resize(N+1);
    for(int i =1 ; i <= M; ++i) {
        int a,b;
        cin >> a >> b;
        G[b].push_back(a);
    }

    for(int i = 1; i <= N; ++i)
        if(!used[i])
            DFS(i);

    return 0;
}