#include <fstream>
#include <vector>

using namespace std;

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

const int MAX = 50001;
vector<int> gr[MAX], srt;
int n, m, v[MAX];

void dfs(int node){
    v[node] = 1;
    for (auto it: gr[node])
        if (!v[it])
            dfs(it);

    srt.push_back(node);
}

int main()
{
    fin >> n >> m;
    for (int a, b; m; m--){
        fin >> a >> b;
        gr[a].push_back(b);
    }

    for (int i = 1; i <= n; i++)
        if (!v[i])
            dfs(i);

    for (vector<int>::const_iterator i = srt.end() - 1; i >= srt.begin(); i--)
        fout << *i << ' ';

    return 0;
}