#include <algorithm>
#include <iostream>
#include <fstream>
#define in cin
#define out cout
#include <vector>
using namespace std;

int pop, v[50001], sol[50001];
vector<int> L[50001];
int n, m, x, y, k;
ifstream fin ("sortaret.in");
ofstream fout("sortaret.out");

void dfs(int nod) {
    v[nod] = 1;
    for (int i=0;i<L[nod].size();i++) {
        int vecin = L[nod][i];
        if (v[vecin] == 0)
            dfs(vecin);
    }
    sol[++k] = nod;
}

int main () {

    int n; fin >> n>>m;

    for (int i = 0; i < m; i++) {
        fin >> x>>y;
        L[x].push_back(y);
    }

    for (int i=1;i<=n;i++)
        sort(L[i].begin(), L[i].end());

    for (int i=1;i<=n;i++)
        if (v[i] == 0)
            dfs(i);
    for (int i=k;i>=1;i--)
        fout<<sol[i]<<" ";
}