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

using namespace std;

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

const int NLIM = 5000;
const int MLIM = 100001;

int n, m;
bool viz[NLIM];

vector < int > muchii[NLIM];
queue <int > coada;

void citeste()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x,y;
        fin >> x >> y;
        muchii[x].push_back(y);
    }
}

void sort(int nod)
{
    viz[nod] = true;
    coada.push(nod);

        for (unsigned int i = 0 ;i < muchii[nod].size(); i++)
        {
            int NodUrmator = muchii[nod][i];
            if (!viz[NodUrmator])
            {
                sort(NodUrmator);
            }
        }

}

int main()
{
    citeste();
    for (int i = 1; i <= n;i++)
    {
        if (!viz[i])
        {
            sort(i);
        }
    }
    while (!coada.empty())
    {
        fout << coada.front() << " ";
        coada.pop();
    }

    return 0;
}