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

using namespace std;

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

const int DMAX = 100005;

unsigned int n, m;
vector <unsigned int> G[DMAX];

vector <bool> viz;
list <unsigned int> sol;

void read()
{
    f >> n >> m;

    viz = vector <bool> (n + 1, false);

    for (unsigned int i = 1; i <= m; i++)
    {
        unsigned int x, y;

        f >> x >> y;

        G[x].push_back(y);
    }
}

void dfs(unsigned int nod)
{
    viz[nod] = true;

    for (auto vecin : G[nod])
    {
        if (viz[vecin] == false)
        {
            dfs(vecin);
        }
    }

    sol.push_front(nod);
}

int main()
{
    read();

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

    for (auto it = sol.begin(); it != sol.end(); it++)
        g << *it << ' ';

    return 0;
}