#include <fstream>
#include<bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector<int> se[50001];
vector<int> top;
bool viz[50001];
void dfs(int x, vector<int> &v)
{
    viz[x]=true;
    for (auto vec: se[x])
    {
        if (!viz[vec])
        {
            dfs(vec,v);
        }
    }
    v.push_back(x);
}

int main()
{
    int n,m,a,b;
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        in>>a>>b;
        se[a].push_back(b);
    }
    for(int i=1; i<=n; i++)
    {
        if(!viz[i])
        {
            dfs(i,top);
        }
    }
    reverse(top.begin(),top.end());
    for(int i=0; i<top.size(); i++)
    {
        out<<top[i]<<" ";
    }

    return 0;
}