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

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

using namespace std;
int n, t, i, x, y, g[50005];
queue <int> q;
vector <int> v[50005];
vector <int>::iterator it;
int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d%d", &n, &t);
    while(t--)
    {
        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();
        for(it=v[x].begin();it!=v[x].end();it++)
        {
            y=*it;
            g[y]--;
            if(g[y]==0) q.push(y);
        }

        printf("%d ", x);
        q.pop();
    }
    return 0;
}