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

#define Nmax 50005

using namespace std;
int N,M;
vector<int> G[Nmax];
bitset<Nmax> used;
stack<int> S;

void read( void )
{
    scanf("%d%d",&N,&M);
    int a,b;
    for(int i = 1; i <= M; ++i) /// fraier mai is daca pun N in loc de M
    {
        scanf("%d%d",&a,&b);
        G[a].push_back(b);
    }
}

void DFS(int k)
{
    used[k] = 1;
    for(vector<int> ::iterator it= G[k].begin(); it != G[k].end(); ++it)
            if(!used[*it])
                DFS(*it);
    S.push(k);
}

void solve()
{
    for(int i = 1; i <= N; ++i)
        if(!used[i])
            DFS(i);
    while(!S.empty()){
        printf("%d ",S.top());
        S.pop();
    }
}

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

    read();
    solve();

    return 0;
}