#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

int N,M,X,Y;

vector<int>g[50001];
vector<int>top;
bool viz[50001];

void dfs(int nod)
{ 
   viz[nod]=1;

   for(int i : g[nod])
      if(viz[i]==0)dfs(i);
    
   top.push_back(nod);   
}

int main()
{
    fin>>N>>M;

    for(int i=0;i<M;i++)
    {
        int x,y;
        fin>>x>>y;
        g[x].push_back(y);
    }

    for(int i=1;i<=N;i++)
    {
        if(!viz[i])dfs(i);
    }

    reverse(top.begin(),top.end());

    for(int i=1;i<=N;i++)fout<<top[i]<<" ";
    
    fin.close();
    fout.close();
    return 0;
}