#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

int n, m, a, b;

bool viz[50002];

vector<int> v[50002];

vector<int> e;

void dfs(int start) {

    viz[start] = 1;
    e.push_back(start);

    for (int i=0; i<v[start].size(); i++) {

        dfs(v[start][i]);

    }

}

void topSort(int n) {

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

}

int main()
{

    fin>>n>>m;

    for (int i=1; i<=m; i++) {

        fin>>a>>b;

        v[a].push_back(b);

    }

    topSort(n);

    for (int i=0; i<e.size(); i++) {
        fout<<e[i]<<" ";
    }

    return 0;
}