#include <iostream>
#include <fstream>
#include <vector>
#include <deque>

using namespace std;

vector<deque<int> > L(50000 + 1, std::deque<int> (1));
bool viz[50000 + 1];
int n, m, i, j;

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

void travad(int i)
{
    fout << i << ' ';
    viz[i] = 1;
    int j = 1;
    while(j < L[i].size())
    {
        if(viz[L[i][j]] == 0)
            travad(L[i][j]);
        j++;
    }
}

int main()
{
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        L[x].push_back(y);
        //L[y].push_back(x);
    }
    for(i = 1; i <= n; i++)
    {
        if(viz[i] == 0)
        {
            travad(i);
            fout << ' ';
        }
    }
}