//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int Max=50005;
int n,m,gin[Max];
vector < int >v[Max],nodd;
void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        in>>x>>y; v[x].push_back(y);
        gin[y]++;
    }
}
void getnode()
{
    int nod;
    for(int i=1;i<=n;i++)
     if(gin[i]==0)
    {
      nodd.push_back(i); gin[i]=-1; nod=i;
      break;
    }
   for(int j=0;j<v[nod].size();j++)
    gin[v[nod][j]]--;

}
void sortt()
{
    for(int i=1;i<=n;i++)
        getnode();
}
int main()
{
    citire();
    sortt();
    for(int i=0;i<nodd.size();i++)
        out<<nodd[i]<<" ";
    return 0;
}