#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <bitset>

using namespace std;

const int NMax = 50005;
vector < int > G[NMax];
stack < int > st;
bitset < NMax > viz;
int N, M;

void DFS(int nod)
{
    viz[nod] = 1;

    for(auto it: G[nod])
        if(!viz[it])
            DFS(it);

    st.push(nod);

}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d%d",&N,&M);
    for(int i=1; i<=M; ++i)
    {
        int x,y;
        scanf("%d%d", &x,&y);
        G[x].push_back(y);
    }

    for(int i=1; i<=N; ++i)
        if(!viz[i])
            DFS(i);

    while(!st.empty())
    {
        cout << st.top() << " ";
        st.pop();
    }

    return 0;
}