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

using namespace std;

const int MAX = 50002;

vector<int> v[MAX];
queue<int> q;
int pred[MAX], n, m;

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

    int a, b, tata, fiu;
    scanf("%d%d", &n ,&m);
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d", &a, &b);
        pred[b]++;
        v[a].push_back(b);
    }
    for(int i=1; i<=n; i++)
        if(!pred[i])
            q.push(i);
    vector<int>::iterator it;
    while(!q.empty())
    {
        tata = q.front();
        q.pop();
        printf("%d ", tata);
        for(it=v[tata].begin(); it!=v[tata].end(); ++it)
        {
            fiu = *it;
            pred[fiu]--;
            if(!pred[fiu])
                q.push(fiu);
        }
    }
    return 0;
}