#include <cstdio>
#include <vector>
#include <stack>

#define Nmax 50005

using namespace std;

int used[Nmax],N,M;
vector<int> G[Nmax];
stack<int> S;

void read()
{
    scanf("%d%d",&N,&M);
    int a,b;
    for(int i = 1; i <= M; ++i)
    {
        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);
    if(used[k] == 1)
    {
        S.push(k);
        used[k] = 2;
    }
}

void afish()
{
    while(!S.empty())
    {
        printf("%d ",S.top());
        S.pop();
    }
}

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

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

    return 0;
}