#include <bits/stdc++.h>

using namespace std;

FILE *F=fopen("sortaret.in", "r"), *G=fopen("sortaret.out", "w");

int n, x, y, m;
vector<int> a[50003];
stack<int> st;
bitset<50005> w;

void dfs(int nod)
{
    vector<int> :: iterator it;
    w[nod] = 1;
    for(it = a[nod].begin(); it != a[nod].end(); ++ it)
        if(!w[*it]) dfs(*it);
    st.push(nod);
}

int main()
{
    fscanf(F, "%d %d ", &n, &m);
    for(int i = 1; i <= m; ++ i)
    {
        fscanf(F, "%d %d ", &x, &y);
        a[x].push_back(y);
    }
    for(int i = 1; i <= n; ++ i)
        if(!w[i]) dfs(i);
    while(!st.empty()) fprintf(G, "%d ", st.top()), st.pop();
    return 0;
}