#include <bits/stdc++.h>

using namespace std;

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

const int nmax=50005;
int n, m;
bool viz[nmax], gr[nmax];
vector<int> v[nmax], nodes;

void DFS(int nod) {
    viz[nod] = 1;
    for (auto it : v[nod])
        if (!viz[it])
            DFS(it);
    nodes.push_back(nod);
}

int main()
{
    int x,y,i;
    fin >> n >> m;
    for (i = 1; i <= m; ++i) {
        fin >> x >> y;
        v[x].push_back(y);
        gr[y] = 1;
    }
    for (i = 1; i <= n; ++i)
        if (!gr[i])
            DFS(i);


    for (i=nodes.size()-1;i>=0;i--)
        fout << nodes[i] << " ";
}