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

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


int n,m;
vector <int> vecini[50005];
vector <int> solutie;
bool viz[50005];
int a,b;

void DFS(int curent)
{
    viz[curent]=true;


    for(int v:vecini[curent])
        if(viz[v]==false)
        DFS(v);
        solutie.push_back(curent);
}
int main()
{
    fi>>n>>m;

    for(int i=1;i<=m;i++)
    {
        fi>>a>>b;

        vecini[a].push_back(b);
    }


    for(int i=1;i<=n;i++)
        if(viz[i]==false) DFS(i);

reverse(solutie.begin(),solutie.end());
for(int x:solutie)
    fo<<x<<" ";
    fi.close();
    fo.close();
    return 0;
}