#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define MAX 50010

vector <int> G[MAX];
int viz[MAX];
int st[MAX];
int dr;

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

    for(auto it : G[nod])
        if(!viz[it])
            dfs(it);
    dr++;
    st[dr] = nod;
}


int main()
{
    int n, m, x, y, i;
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    for(i = 1 ; i <= n ; i++)
    {
        if(!viz[i])
            dfs(i);
    }
    for(i = n ; i >= 1 ; i --)
    {
        fout << st[i] << ' ';
    }
    fout << "\n";
}