#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>

#define INF ( (1 << 30) - 1 + (1 << 30) )
#define mod 666013

using namespace std;

int n, m, i, x, y;
int g[50005];

vector <int> v[50005];
vector <int> :: iterator it;
queue <int> q;

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

    scanf("%d%d", &n, &m);
    while( m-- )
    {
        scanf("%d%d", &x, &y);
        g[y]++;
        v[x].push_back(y);
    }

    for(i = 1; i <= n; i++)
        if(g[i] == 0)
            q.push(i);

    while(!q.empty())
    {
        x = q.front();
        q.pop();
        printf("%d ", x);

        for(it = v[x].begin(); it != v[x].end(); it++)
        {
            y = *it;
            g[y]--;
            if(g[y] == 0)
                q.push(y);
        }
    }

    return 0;
}