#include    <fstream>
#include    <iostream>
#include    <vector>
#define NMAX 100005
using namespace std;
 
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
 
 
bool used[NMAX];
int N, M, ordine[NMAX], k;
 
vector < int > V[NMAX];
 
void DFS(int node)
{
    used[node] = true;
    for(unsigned int i = 0; i < V[node].size(); i++)
    {
        if(!used[V[node][i]])
            DFS(V[node][i]);
    }
    ordine[++k] = node;
 
}
 
void Read()
{
    int x, y;
    fin >> N >> M;
    for(int i = 1; i <= M; i++)
    {
        fin >> x >> y;
        V[x].push_back(y);
    }
}
 
int main()
{
    Read();
    for(int i = 1; i <= N; i++)
    {
        if(!used[i])
            DFS(i);
    }
    for(int i = k; i >= 1; i--)
        fout << ordine[i] << " ";
    fout << "\n";
    return 0;
}