#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector<int>v[100003];
int visit[50002];
int vect[50002],a=1;
void dfs(int nod)
{

    visit[nod]=1;
    for(int y=0; y<v[nod].size(); y++)
    {
        int vecin = v[nod][y];
        if(visit[vecin]==0)
            dfs(vecin);
    }

    vect[a]=nod;
    a++;
}

//vect = [4 7 8 9 2 3 1 6]
int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n, m,i, x, y;
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }

    for(i=1; i<=n; i++)
        if(visit[i]==0)
            dfs(i);

    for(i=a-1; i>=1; i--)
        out<<vect[i]<<' ';
    return 0;
}