#include <iostream>
#include <fstream>
#include <vector>

#define N 50005

using namespace std;

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

vector <int> a[N], sol;
vector <bool> viz(N);

void dfs(int x)
{
    viz[x] = 1;
    for(int i=0; i<a[x].size(); i++)
        if(!viz[a[x][i]]) dfs(a[x][i]);
    sol.push_back(x);
}

int main()
{
    int n, m, x, y;
    fin>>n>>m;
    while(m--)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }

    for(int i=1; i<=n; i++)
        if(!viz[i]) dfs(i);

    for(int i=sol.size()-1; i>=0 ; i--)
        fout<<sol[i]<<" ";
    return 0;
}