#include <bits/stdc++.h>
#define oo 2e9
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> G[50005];

int n, m, x, y, C[50005], ct, viz[50005];

void DFS(int x)
{
    viz[x] = 1;
    for(auto i: G[x])
        if(!viz[i])
            DFS(i);
    C[++ct] = x;
}

int main()
{
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        if(!viz[i])
            DFS(i);

    for(int i =n; i >= 1; i--)
        fout << C[i] << " ";
   return 0;
}