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

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

int main()
{
    int nod,i;
    vector<int>::iterator it;
    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[n2]++;
    }

    for(i=1;i<=n;i++) if(!val[i]) s.push(i);

    while(!s.empty())
    {
        nod=s.top(); s.pop();
        printf("%d ",nod);
        for( it=m[nod].begin();it!=m[nod].end();it++)
        {
            val[*it]--;
            if(!val[*it]) s.push(*it);
        }
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}