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

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

const int maxN = 50005;

bool visit[maxN];
vector <int> g[maxN];
vector <int> sTop;
int grad[maxN];

void dfs(int node) {
    visit[node] = true;

    for(auto to : g[node])
        if(visit[to] == false)
            dfs(to);

    sTop.push_back(node);
}

int main()
{
    int n, m; fin >> n >> m;

    for(int i = 1; i <= m; ++i) {
        int u, v; fin >> u >> v;
        g[u].push_back(v);
        grad[v]++;
    }

    int root = -1;
    for(int i = 1; i <= n; ++i)
        if(grad[i] == 0)
            root = i;

    dfs(root);

    vector <int> :: reverse_iterator it;
    for(it = sTop.rbegin(); it != sTop.rend(); it++)
        fout << *it << " ";

    return 0;
}