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

using namespace std;

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

const int NMAX = 50000;
const int MMAX = 100000;

vector <int> Graf[NMAX+2];

int sol[NMAX+2];
int v[NMAX+2];
int n,m;
int d=1;

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

int tpsort(int nod)
{
    sol[d++]=nod;
    for(int i=0;i<(int)Graf[nod].size();i++)
    {
        if(v[Graf[nod][i]]==0)
        {
        v[Graf[nod][i]]=1;
        tpsort(Graf[nod][i]);
        }
    }
}

void afisare()
{
    for(int i=1;i<=n;i++)
    {
        out<<sol[i]<<" ";
    }
}

int main()
{
    citire();
    for(int i=1;i<=n;i++)
    {
        if(v[i]==0)
        {
            v[i]=1;
            tpsort(i);
        }
    }
    afisare();
    return 0;
}