#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

#define cin fin
#define cout fout

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

const int NMAX=5e4+5;

bool viz[NMAX];
vector<int>v[NMAX];
vector<int>topos;

void dfs(int p)
{
    viz[p]=true;
    for(auto i:v[p])
    {
        if(!viz[i])
            dfs(i);
    }
    topos.push_back(p);
}

int main()
{
    int n,m,i,j,x,y;
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    reverse(topos.begin(),topos.end());
    for(auto i:topos)
        cout<<i<<" ";
    return 0;
}