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

using namespace std;
#define MAX 50005

vector<int> v[MAX];
priority_queue<int, vector<int>, greater<int> > q;
int n, m, pred[MAX], nod[MAX];

bool comp(int a, int b)
{
    return pred[a] > pred[b];
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    int i, a, b, tata, fiu;
    scanf("%d%d", &n, &m);
    for(i=1; i<=m; i++)
    {
        scanf("%d%d", &a, &b);
        v[a].push_back(b);
        pred[b]++;
    }
    for(i=1; i<=n; i++)
        nod[i] = i;
    make_heap(nod+1, nod+n+1, comp);
    while(n>0)
    {
        tata = nod[1];
        printf("%d ", tata);
        pop_heap(nod+1, nod+n+1);
        n--;
        vector<int>::iterator it;
        for(it=v[tata].begin(); it!=v[tata].end(); ++it)
        {
            fiu = *it;
            pred[fiu]--;
        }
        sort_heap(nod+1, nod+n+1);
    }
    return 0;
}