#include <bits/stdc++.h>

using namespace std;
/****************************************************/
ifstream f("sortaret.in");
ofstream g("sortaret.out");
/****************************************************/
const int nmax  = 50069;
int n , m , cont;
int rasp[nmax];
vector <int> vecini[nmax];

bool vizitat[nmax];
/****************************************************/
///-----------------------------------------------------------------------
inline void readInput()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x , y;
        f>>x>>y;
        vecini[x].push_back(y);
    }
    cont = n;
}
///-----------------------------------------------------------------------
void dfs(int nod)
{
    vizitat[nod]=1;

    for(int i=0 ; i<vecini[nod].size();i++)
    {
        if(!vizitat[vecini[nod][i]])
        {
            dfs(vecini[nod][i]);
        }
    }
    rasp[cont] = nod;
    cont--;
}
///-----------------------------------------------------------------------
inline void Solution()
{
    dfs(1);
}
///-----------------------------------------------------------------------
inline void Afisare()
{
    for(int i=1;i<=n;i++) g<<rasp[i]<<" ";
}
///-----------------------------------------------------------------------
int main()
{
    readInput();
    Solution();
    Afisare();
    return 0;
}