#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <stack>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

#define ll long long
#define ull unsigned long long
#define pb push_back
const ll inf = 1e18 + 5;
const int NMax = 5e4 + 5;

int N,M;
bool vis[NMax];
vector<int> v[NMax];
stack<int> st;

void dfs(int);

int main() {
    in>>N>>M;
    for (int i=1;i <= M;++i) {
        int x,y;
        in>>x>>y;

        v[x].pb(y);
    }

    for (int i=1;i <= N;++i) {
        if (vis[i]) {
            continue;
        }

        dfs(i);
    }

    while(st.size()) {
        out<<st.top()<<' ';
        st.pop();
    }

    in.close();out.close();
    return 0;
}

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

    for (int nxt : v[node]) {
        if (vis[nxt]) {
            continue;
        }

        dfs(nxt);
    }

    st.push(node);
}