#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
int n,m,d[50005];
vector <int> gr[50005],s;
void dfs(int node)
{
    d[node] = 1;
    s.push_back(node);
    for(int i =0;i<gr[node].size();++i)
    {
        if(d[gr[node][i]]==0)
            dfs(gr[node][i]);
    }
}
int main()
{
    fin >> n >> m;
    for(int i=1;i<=m;++i)
    {
        int x,y;
        fin >> x >> y;
        gr[x].push_back(y);
    }
    for(int i=1;i<=n;++i)
    {
        if(d[i]==0)
            dfs(i);
    }
    //reverse(s.begin(),s.end());
    for(int i=0;i<s.size();++i)
        fout << s[i] << " ";
    return 0;
}