#include <fstream>
#include <iostream>
#include <vector>
#include <stack>
#define NMAX 50000

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
vector<int> g[NMAX];
stack <int> s;
bool viz[NMAX] = { 0 };

void dfs(int x) {
    viz[x] = true;
    for (int y : g[x]) {
        if (!viz[y])
            dfs(y);
    }
    s.push(x);
}

int main()
{
    fin >> n >> m;
    for (int i = 1;i <= m;++i) {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
    }
    for (int i = 1;i <= n;++i)
        if (!viz[i])
            dfs(i);
    while (!s.empty()) {
        fout << s.top() << ' ';
        s.pop();
    }


    return 0;
}