#include<bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
typedef long long ll;
typedef long double ld;

const int N = 5e4 + 5;
int n, m, a, b, toposort[N], k;
bool viz[N];
vector<int> v[N];
void DFS(int nod)
{
    viz[nod] = 1;
    for (int i : v[nod])
        if (!viz[i])
            DFS(i);
    toposort[++k] = nod;
}

int main()
{
    fin >> n >> m;
    while (m--)
    {
        fin >> a >> b;
        v[a].push_back(b);
    }
    for (int i = 1; i <= n; i++)
        if (!viz[i])
            DFS(i);
    reverse(toposort + 1, toposort + k + 1);
    for (int i = 1; i <= n; i++)
        fout << toposort[i] << ' ';
    return 0;
}