#include <iostream>
#include <fstream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

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

const int Nmax=50005;
const int Mmax=100005;
int N,M;
vector <int> Muchii[Nmax];
bitset <Nmax> viz;
vector <int> Solutie;

void DFS(int nod)
{
    viz[nod]=1;
    for(unsigned int i=0;i<Muchii[nod].size();i++)
    {
        int vecin=Muchii[nod][i];
        if(!viz[vecin])
          DFS(vecin);
    }
        Solutie.push_back(nod);
}


void read()
{
    fin>>N>>M;
    int x,y;
    for(int i=0;i<M;i++)
     {
        fin>>x>>y;
        Muchii[x].push_back(y);
     }

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


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

}
int main()
{
    read();

    return 0;
}