#include <iostream>
#include <fstream>
#include <forward_list>
#include <vector>
using namespace std;

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

int n;
vector < vector < int > > v;
vector < bool > viz;
forward_list < int > sol;

void init()
{
    v.resize(n+1);
    viz.resize(n+1,false);
}

void citire()
{
    int m,i,x,y;
    in>>n>>m;
    init();
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }

}

void dfs(int nod)
{
    viz[nod]=true;
    for(auto i : v[nod])
        if(!viz[i])
            dfs(i);
    sol.insert_after(sol.before_begin(),nod);
}

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

void afisare()
{
    for(auto i:sol )
        out<<i<<' ';
}

int main()
{
    citire();
    rezolvare();
    afisare();
    return 0;
}