#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

#define nmax 50005
using namespace std;

int n,m;
int grad[nmax];
vector<int> g[nmax];
queue<int> q;

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);
        grad[b]++;
    }
}

void bfs(int x)
{
    for(int i=0;i<g[x].size();i++)
    {
        grad[g[x][i]]--;
        if(grad[g[x][i]]==0)
            q.push(g[x][i]);
    }
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    read();
    for(int i=1;i<=n;i++)
        if(grad[i]==0)
            q.push(i);
    while(!q.empty())
    {
        bfs(q.front());
        printf("%d ",q.front());
        q.pop();
    }
    return 0;
}