#include <fstream>
#include <queue>
#include <vector>
#define NM 50003
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,x,y;
int dp[NM];
vector < int > a[NM];
queue < int > v;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y; a[x].push_back(y);
        dp[y]++;
    }
    for(i=1;i<=n;i++)
      if(dp[i]==0) v.push(i);
    while(!v.empty()){
        x=v.front(); v.pop();
        g<<x<<' ';
        for(i=0;i<a[x].size();i++){
            y=a[x][i]; dp[y]--;
            if(!dp[y]) v.push(y);
        }
    }
    return 0;
}