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

using namespace std;

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

const int NMAX = 50002;
int n, m, viz[NMAX];
vector<int> G[NMAX];
queue<int> ord;

void dfs(int nod)
{
    ord.push(nod);
    viz[nod] = 1;
    for (int i = 0; i < G[nod].size(); i++)
    {
        if (viz[G[nod][i]]) continue;

        if (ord.size() == n) return;
        dfs(G[nod][i]);
    }
}
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 (!ord.empty())
    {
        fout << ord.front() << " ";
        ord.pop();
    }
    return 0;
}