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

using namespace std;

ifstream fin("sortare.in");
ofstream fout("sortare.out");
const int NMAX=10001;

vector < int > G[NMAX],C;
queue < int > q;


int n,m,viz[NMAX],k,v[NMAX],p[NMAX];

void citire()
{
    int x,y;
    fin>>n>>m;
    while(fin>>x>>y)
    {
        G[x].push_back(y);
    }
}


void DFS(int nod)
{

    viz[nod]=1;
    for(auto el: G[nod])
    {
        if(!viz[el])
        {

            DFS(el);
        }
    }
    C.push_back(nod);
}
int main()
{
    citire();
    for(int i=1;i<=n;i++)
    {
        if(!viz[i])
            DFS(i);

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