#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

int n, m, x, y;
int d[100005];
vector <int> v[100005];
queue <int> q;

void sortareBfs()
{
    while(!q.empty())
    {
        int nodCurent=q.front();
        q.pop();
        printf("%d ", nodCurent);
        for(auto vecin:v[nodCurent])
        {
            d[vecin]--;
            if(d[vecin] == 0)
                q.push(vecin);
        }
    }
}

int main()
{

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

    scanf("%d %d", &n, &m);

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

    for(int i=1; i<=n; i++)
    {
        if(d[i] == 0)
            q.push(i);
    }
    sortareBfs();

    return 0;
}