#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=50000+5;

int n,m,viz[N];
vector<int>v[N];
vector<int>a;

inline void dfs(int nod)
{
    viz[nod]=1;
    for(auto nou:v[nod])
    {
        if(viz[nou]==0)
        {
            dfs(nou);
        }
    }
    a.push_back(nod);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            dfs(i);
    reverse(a.begin(),a.end());
    for(auto x:a)
        cout<<x<<" ";
    cout<<"\n";
    return 0;
}
/**

1
10 18 76

**/