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

using namespace std;

int grad[50001], C[50001], n, m, x, y;
vector<int> G[50001];
int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d %d\n", &n, &m);
    for(int i = 0; i < m; i++)
    {
        scanf("%d %d\n", &x, &y);
        G[x].push_back(y);
        grad[y]++;
    }
    for(int i = 1; i <= n ; i++)
        if(!grad[i])
            C[++C[0]]=i;
    for(int i = 1; i <= n; i++)
    {
        x = C[i];
        for(vector<int>::iterator it = G[x].begin(); it != G[x].end(); ++it)
        {
            grad[*it]--;
            if(!grad[*it]) C[++C[0]] = *it;
        }
    }
    for(int i = 1; i <= n; i++)
        printf("%d ", C[i]);
    return 0;
}