#include <bits/stdc++.h>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");


int n,m,x,y;
vector<int>G[50005],sol;
int viz[50005];

void DFS(int node)
{
   viz[node]=1;
   for(auto x:G[node])
    if(viz[x]==0) DFS(x);
     
   viz[node]=2;
   sol.push_back(node);
}

int main() 
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
    
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
         DFS(i);
         
    for(int i=sol.size()-1;i>=0;i--) g<<sol[i]<<" ";
    return 0;
}