#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int max_size = 5e4 + 1;

int viz[max_size];
vector <int> edges[max_size], ord;

void dfs (int nod)
{
    ord.push_back(nod);
    viz[nod] = 1;
    for (auto f : edges[nod])
    {
        if (viz[f] == 0)
        {
            dfs(f);
        }
    }
   // ord.push_back(nod);
}

int main ()
{
    int n, q;
    in >> n >> q;
    while (q--)
    {
        int x, y;
        in >> x >> y;
        edges[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
    {
        if (viz[i] == 0)
        {
            dfs(i);
        }
    }
  //  reverse(ord.begin(), ord.end());
    for (auto f : ord)
    {
        out << f << " ";
    }
    in.close();
    out.close();
    return 0;
}