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

using namespace std;

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

#define N 100005

vector < int > L[N];
int v[N];
bool viz[N];

int n, m;

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

void DFS(int k)
{
   viz[k] = 1;
   for(int i = 0; i < L[k].size(); i++)
        if(viz[L[k][i]] == 0)
            DFS(L[k][i]);
   v[++v[0]] = k;
}

int main()
{
    citire();
    for(int i = 1; i <= n; i++)
        if(!viz[i])
            DFS(i);
    for(int i = v[0]; i >= 1; i--)
        fout << v[i] << " ";
    return 0;
}