#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
vector <int> a[50004];
bool v[50004];
int L;
int s[50004];

void DFS(int k)
{
    v[k] = true;
    int l = a[k].size();
    for (int i = 0; i < l; i++)
        if (!v[a[k][i]])
            DFS(a[k][i]);
    s[++L] = k;
}

int main()
{
    int i, x, y;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        a[x].push_back(y);
    }
    for (i = 1; i <= n; i++)
        if (!v[i])
            DFS(i);
    for (; L > 0; L--)
        fout << s[L] << " ";
    return 0;
}