#include <bits/stdc++.h>
#define oo 2000000
using namespace std;

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

vector<int> g[50001];
int viz[50001], n, m;
int sol[50001], len;

void Citire()
{
    int i, j, p;
    fin >> n >> m;
    for (p = 1; p <= m; p++)
    {
        fin >> i >> j;
        g[i].push_back(j);
    }
}

void DFS(int k)
{
    viz[k] = 1;
    for (int i : g[k])
        if (viz[i] == 0) DFS(i);
    sol[++len] = k;
}

void SortTop()
{
    for (int i = 1; i <= n; i++)
        if (viz[i] == 0)
            DFS(i);
}

void Afis()
{
    for (int i = n; i >= 1; i--)
        fout << sol[i] << " ";
}

int main()
{
    Citire();
    SortTop();
    Afis();
    return 0;
}