#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>

using namespace std;

const int N=50000+5;

int n,m;
vector<int>g[N];
bool seen[N];
vector<int>Sort;

inline void add(int nod)
{
    seen[nod]=1;
    for(auto &nou:g[nod])
    {
        if(seen[nou]==0)
        {
            add(nou);
        }
    }
    Sort.push_back(nod);
}

int main()
{
    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;
        g[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
    {
        if(seen[i]==0)
        {
            add(i);
        }
    }
    reverse(Sort.begin(),Sort.end());
    for(auto &x:Sort)
    {
        cout<<x<<" ";
    }
    cout<<"\n";
    return 0;
}