#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector<int> L[50001];
//folosim dfs pe timpi finali
//punem intr-o coada nodurile care au grad interior 0
int d[50002];
int poz=0;
int viz[50001];

void DFSTF(int k)
{
    viz[k]=1;
    for(int i=0;i<L[k].size();i++)
        if(!viz[L[k][i]])
            DFSTF(L[k][i]);

    d[poz]=k;
    poz++;
}


void Citire()
{
    int n,m,x,y;
    ifstream fin("sortaret.in");
    fin>>n>>m;
    for(int i=0;i<m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
    fin.close();


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

    ofstream fout("sortaret.out");
    for(int i=poz;i>0;i--)
        fout<<d[i]<<" ";
    fout<<"\n";
    fout.close();

}

int main()
{
    Citire();
    return 0;
}