#include <iostream>
#include <fstream>
#include <stack>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

struct nod
{
    int val;
    nod *next;
};
nod *l[50001];
int n,m;
///int fr[50001];
int gr_int[50001];
stack<int> st;

void adauga(int i,int j)
{
    nod *q=new nod;
    q->val=j;
    q->next=l[i];
    l[i]=q;
}

void citire ()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        adauga(x,y);
        gr_int[y]++;
    }
}

void parcurg()
{
 for(int i=1;i<=n;i++)
 {
     if(gr_int[i]==0) st.push(i);
 }
}

void sortare_topologica()
{
    while(!st.empty())
    {
        int top=st.top();
        st.pop();
        if(gr_int[top]==0)
        {
            fout<<top<< ' ';
            for(nod *p=l[top];p!=NULL;p=p->next)
            {
                gr_int[p->val]--;
                st.push(p->val);
            }
        }
    }
}

int main()
{
    citire();
    parcurg();
    sortare_topologica();
    return 0;
}