#include <bits/stdc++.h>
using namespace std;
vector<int>v[100005];
stack<int>st;
int fr[100005];
void dfs(int nod)
{
    fr[nod]=1;
    vector<int>::iterator it;
    for(it=v[nod].begin();it!=v[nod].end();it++)
    {
        if(!fr[*it])
      dfs(*it);
    }
    st.push(nod);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int n,m,a,b,i;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        if(!fr[i])dfs(i);
    while(!st.empty())
    {
        cout<<st.top()<< " ";
        st.pop();
    }
    return 0;
}