#include <fstream>
#include <vector>
using namespace std;

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

const int NMax = 50000;
int N, M, K;
int O[NMax + 5];
bool Use[NMax + 5];

vector <int> G[NMax + 5];

void Read()
{
    in >> N >> M;
    for(int i = 1;i<=M;++i)
    {
        int x,y;
        in >> x >> y;
        G[x].push_back(y);
    }
}

void DFS(int Nod)
{
    Use[Nod] = 1;
    for(int i = 0;i < (int)G[Nod].size();++i)
    {
        int Vecin = G[Nod][i];
        if(!Use[Vecin])
            DFS(Vecin);
    }
    O[++K] = Nod;
}

int main()
{
    Read();
    for(int i = 1;i<=N;++i)
    {
        if(!Use[i])
            DFS(i);
    }
    for(int i = K;i>=1;--i)
        out<<O[i]<<' ';
    out<<'\n';
}