#include <bits/stdc++.h>

using namespace std;
const string TASK("sortaret");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout

const int N = 1e5 + 9;

int n, m, in[N];
vector<vector<int>> G(N);

vector<int> ord;
bool viz[N];
void Dfs(int x)
{
    viz[x] = true;
    for(auto y : G[x])
        if(!viz[y])
            Dfs(y);
    ord.push_back(x);
}

int main()
{
    cin >> n >> m;

    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        cin >> x >> y;
        G[x].push_back(y);
        in[y] ++;
    }

    for(int i = 1; i <= n; ++i)
        if(!in[i])
            Dfs(i);

    reverse(ord.begin(), ord.end());

    for(auto i : ord)cout << i << ' ';
    cout << '\n';
    return 0;
}