#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <queue>
#define ll long long
#define ull unsigned long long
#define lsb(x) (x & -x)

using namespace std;

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

const int NMAX = 50005;
vector<int> g[NMAX];

void dfs(int node, vector<int> &topsort, vector<bool> &visited) {
    visited[node] = 1;
    for(auto it : g[node])
        if(!visited[it])
            dfs(it, topsort, visited);
    topsort.push_back(node);
}

int main() {

    int n, m;
    in >> n >> m;
    for(int i = 1; i <= m; i ++) {
        int a, b;
        in >> a >> b;
        g[a].push_back(b);
    }

    vector<int> topsort;
    vector<bool> visited(n + 1, 0);
    for(int i = 1; i <= n; i ++)
        if(!visited[i])
            dfs(i, topsort, visited);
    reverse(topsort.begin(), topsort.end());

    for(auto it : topsort)
        out << it << " ";

    return 0;
}