#include <bits/stdc++.h>

using namespace std;
vector<int>vecini[100001];
vector<bool>viz;
stack <int>stiva;
void dfs(int nod)
{
    viz[nod]=true;
    for(auto vecin:vecini[nod])
    {
        if(!viz[vecin])
            dfs(vecin);
    }
    stiva.push(nod);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int n, m;
    cin>>n>>m;
    viz=vector<bool>(n+1,false);
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        vecini[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
    {
        if(!viz[i])
        {
            dfs(i);
        }
    }
    while(!stiva.empty())
    {
        cout<<stiva.top()<<" ";;
        stiva.pop();
    }
    return 0;
}