#include <bits/stdc++.h>

using namespace std;

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

bitset <50001> viz;

vector <int> v[50001], a;

int n, m, i, j;

void DFS (int nod)
{
    vector <int> :: iterator i;
    viz[nod] = 1;
    for (i=v[nod].begin(); i!=v[nod].end(); i++)
        if (viz[*i] == 0)
        {
            DFS(*i);
        }
    a.push_back(nod);
}

int main()
{
    fin >> n >> m;
    while(m--)
    {
        fin >> i >> j;
        v[i].push_back(j);
    }
    for (i=1; i<=n; i++)
        if (viz[i] == 0)
        {
            DFS(i);
        }
    for (vector <int> :: reverse_iterator k=a.rbegin(); k!=a.rend(); k++)
        fout << *k << " ";
    return 0;
}