#include <bits/stdc++.h>
#define Nmax 50005

using namespace std;

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

vector <int> L[Nmax];
int n, m, v[Nmax], k;
bool viz[Nmax];

void Dfs(int nod)
{
    viz[nod] = true;
    for(auto it : L[nod])
        if(!viz[it])
            Dfs(it);
    v[++k] = nod;
}

void Read()
{
    int i, x, y;
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    fin.close();
}

void Solve()
{
    int i;
    for(i = 1; i <= n; i++)
        if(!viz[i])
            Dfs(i);
    for(i = k; i >= 1; i--)
        fout << v[i] << " ";
    fout.close();
}

int main()
{
    Read();
    Solve();
    return 0;
}