#include <bits/stdc++.h>
using namespace std;

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

vector<int> g[50005];
vector<int> noduri;
int n, m;
int v[50005];

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

void dfs(int x) {
    v[x] = 1;
    for(int i = 0; i < g[x].size(); i++)
        if(!v[g[x][i]])
            dfs(g[x][i]);
    noduri.push_back(x);
}

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

void afis() {
    for(int i = noduri.size()-1; i >= 0; i--)
        fout << noduri[i] << ' ';
}

int main() {
    citire();
    solve();
    afis();
}