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

using namespace std;

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

const int DIM = 50005;

int n,m,x,y,viz[DIM],St[DIM],cnt=0;

vector <int> G[DIM];

void DFS(int nod)
{
    viz[nod]=1;
    for(auto it : G[nod])
    {
        if(!viz[it])
            DFS(it);
    }
    cnt++;
    St[cnt]=nod;
}

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

void Print()
{
    for(int i=1;i<=n;i++)
    {
        if(!viz[i])
        {
            cnt=0;
            DFS(i);
            for(int j=1;j<=cnt;j++)
                fout<<St[j]<<" ";
        }
    }
}

int main()
{
    Read();
    Print();
}