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

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

const int N = 2e5 + 5;

vector <int> g[N];

int n, m;

int viz[N];

vector <int> ce;

void dfs(int nod)
{
    viz[nod] = 1;
    for(auto next:g[nod])
    {
        if(!viz[next])
            dfs(next);
    }
    ce.push_back(nod);
}

int main()
{
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        g[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(!viz[i])
        {
            dfs(i);
        }
    }
    reverse(ce.begin(), ce.end());
    for(auto x:ce) out << x << ' ';
    return 0;
}