#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>
#include <stack>
#define nmax 50010
using namespace std;

int n,m1,val[nmax],nr;
stack <int> sol,s;
bitset <nmax> viz,parc;
vector<int> m[nmax];

inline void solve(int i)
{
    vector<int>::iterator it;
    int nod;
    s.push(i);
    while(!s.empty())
    {
        nod=s.top();
        if(viz[nod])
        {
            if(!parc[nod])
            { sol.push(nod); parc[nod]=1; }
            s.pop();
        }
        else
        {
            for(it=m[nod].begin();it!=m[nod].end();it++)
                if(!viz[*it])
                    s.push(*it);
        }
        viz[nod]=1;
    }
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    cin>>n>>m1;
    int n1,n2;
    for(;m1;m1--)
    {
        cin>>n1>>n2;
        m[n1].push_back(n2);
        val[n1]++;
    }
    int i;
    for(i=1;i<=n;i++) if(!viz[i]) solve(i);
    while(!sol.empty())
    {
        cout<<sol.top()<<' '; sol.pop();
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}