#include <iostream>
#include <vector>
#include <fstream>
#define nmax 100001
using namespace std;

vector <int> v[nmax],sol;
bool seen[50001];
int x,y,i,m,n;
void dfs (int x)
   {
       seen[x]=true;


       for (int j=0;j<v[x].size();j++)
       {
           y=v[x][j];
           if (!seen[y]) dfs(y);

       }
       sol.push_back(x);
   }
int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for (i=1;i<=n;i++)
    {
        if (!seen[i]) dfs(i);
    }
    for(i=sol.size()-1;i>=0;i--)
        g<<sol[i]<<" ";
    return 0;
}