#include <bits/stdc++.h>

using namespace std;

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


int n, m;
vector <int> v[50005];
int afis[50005], k;
bool viz[50005];

void dfs(int nod)
{
    viz[nod] = true;
	int l = v[nod].size();
    for(int i = 0; i < l; i++)
        if(viz[v[nod][i]] == false)
            dfs(v[nod][i]);
    afis[++k] = nod;
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        if(viz[i] == false)
            dfs(i);
    for(int i = n; i >= 1; i--)
        g << afis[i] << ' ';
    return 0;
}