#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

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

const int maxn = 5e4 + 5;
vector <int> G[maxn];
bitset <maxn> Vis;
int Ans[maxn];
int n, m, lg;

void Dfs(int node) {
    Vis[node] = true;
    for (auto &it : G[node]) {
        if (Vis[it] == false) Dfs(it);
    }
    Ans[++lg] = node;
}

int main() {
    ios_base :: sync_with_stdio(false);
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    for (int i = 1; i <= n; i++) {
        if (Vis[i] == false) Dfs(1);
    }

    for (int i = lg; i > 0; i--) {
        fout << Ans[i] << " ";
    }
    fout << "\n";
    return 0;
}