#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int N=50001;
vector<int> a[N],x0;
queue<int> q;
int n,v[N],nrp[N];
void citire();
void sot();


int main()
{
    citire();
    sot();
    for(int i=1;i<=n;i++)
        out<<v[i]<<" ";
    out<<"\n";
    return 0;

}
void citire()
{
    int i,j,m,x,y;
    in>>n>>m;
    for(i=1;i<=m;i++)
    {

        in>>x>>y;
        a[x].push_back(y);
        nrp[y]++;
    }
}
void sot()
{
    int x,y,w=1,i;
    for( i=1;i<=n;i++)
    {

        if(nrp[i]==0)
         {
             v[w++]=i;
         }   q.push(i);
    }
    while(!q.empty())
    {

        x=q.front();
        q.pop();
        for(i=0;i<a[x].size();i++)
        {
            nrp[a[x][i]]--;
            if(nrp[a[x][i]]==0)
               {

                    q.push(a[x][i]);
                    v[w++]=a[x][i];
               }
        }

    }

}