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

ifstream fin("sortaret.in");

ofstream fout("sortaret.out");

vector<int> l[N_MAX];
vector<int> sol;
int n, m;
bool viz[N_MAX];

void dfs(int nod)
{
    viz[nod] = true;
    for (auto it : l[nod])
    {
        if (!viz[it])
            dfs(it);
    }
    sol.push_back(nod);
}

int main()
{
    fin >> n >> m;
    while (m--)
    {
        int x, y;
        fin >> x >> y;
        l[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
            dfs(i);
    }
    int lng = sol.size();
    for (int i = 1; i <= lng; i++)
    {
        fout<<sol[lng-i]<<" ";
    }
}