#include <iostream>
#include <fstream>
#include <vector>
#define nmax 50005
using namespace std;

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

int n, m;
vector <int> vecin[nmax], sol;
bool VIZ[nmax];

void dfs(int nod) {
    int i;
    VIZ[nod] = true;
    for (i = 0; i < vecin[nod].size(); i++)
        if (!VIZ[vecin[nod][i]])
            dfs(vecin[nod][i]);
    sol.push_back(nod);
}

void read() {
    int a, b, i;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
        fin >> a >> b,
        vecin[a].push_back(b);
}

void sortaret() {
    int i;
    for (i = 1; i <= n; i++)
        if (!VIZ[i])
            dfs(i);
}

void write() {
    int i;
    for (i = sol.size() - 1; i >= 0; i--)
        fout << sol[i] << " ";
}

int main() {
    read();
    sortaret();
    write();
    fin.close();
    fout.close();
    return 0;
}