#include <iostream>
#include <fstream>
#include <bitset>
#include <algorithm>
#define NMAX 50002

using namespace std;

ifstream f("sortaret.in");
ofstream o("sortaret.out");

int n, m;
vector <int> g[NMAX], sortaret;
bitset <NMAX> viz;

void dfs(int nod)
{
    viz[nod] = true;

    for(auto i: g[nod])
        if(not viz[i])
            dfs(i);

    sortaret.push_back(nod);
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        f >> x >> y;
        g[x].push_back(y);
    }

    for(int i = 1; i <= n; ++i)
        if(not viz[i])
        {
            dfs(i);
        }

    reverse(sortaret.begin(), sortaret.end());

    for(auto i: sortaret)
        o << i << ' ';

    return 0;
}