#include <bits/stdc++.h>

using namespace std;
vector<vector<int> > G;
bitset<666013> used;
int N,M;
stack<int> s;

void DFS(int k)
{
    used[k] = 1;
    for(auto it : G[k])
        if(!used[it])
            DFS(it);
    s.push(k);
}

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

    cin.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[a].push_back(b);
    }

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


    while(!s.empty()){
        cout << s.top() << " ";
        s.pop();
    }

    return 0;
}