#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#define MAXN 50005
using namespace std;

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

int n,m;

vector <int> G[MAXN];
stack <int> Sortare;
int viz[MAXN];

void dfs(int nod)
{
    viz[nod]=1;
    for(auto &x:G[nod])
        if(!viz[x])
            dfs(x);
    Sortare.push(nod);
}

void citire()
{
    fin>>n>>m;
    int x,y;
    for(int i=0;i<m;i++)
        fin>>x>>y, G[x].push_back(y);
}

void afisare()
{
    while(!Sortare.empty())
    {
        fout<<Sortare.top()<<" ";
        Sortare.pop();
    }
}

void sortare()
{
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
}
int main()
{
    citire();
    sortare();
    afisare();
    return 0;
}