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

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

const int N=50005;
vector <int>a[N];
int tps[N],k,n,m;
bool viz[N];

void citire()
{
    int i,x,y;
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
}

void dfs(int nod)
{
    int i,vecin;
    viz[nod]=1;
    for(i=0; i<a[nod].size(); i++)
    {
        vecin=a[nod][i];
        if(viz[vecin]==0)
            dfs(vecin);
    }
    tps[++k]=nod;
}


int main()
{
    int i;
    citire();
    for(i=1; i<=n; i++)
        if(viz[i]==0)
            dfs(i);
    for(i=n; i>=1; i--)
        out<<tps[i]<<" ";
    return 0;
}