#include <iostream>
#include <fstream>
#include <vector>
#define Nmax 50005

using namespace std;

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

int n, m, x, y;
bool seen[Nmax];
vector <int> v[Nmax], sol;

void dfs(int x)
{
    seen[x]=1;
    for (auto y:v[x])
    {
        if(seen[y]==0) dfs(y);
    }
    sol.push_back(x);
}

int main()
{
    f >> n >> m;
    while(m--)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        if(seen[i] == 0)
            dfs(i);
    for (int i = sol.size()-1; i >= 0; i--)
        g << sol[i] << " ";

    return 0;
}