#include <cstdio>
#include <vector>
#include <queue>
#define vv 100001

using namespace std;

vector <int> v[vv];
queue <int> q;
int d[vv],n,m;

void citire()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d%d", &n, &m);
    int a,b;
    for (int i=1; i<=m; i++)
    {
        scanf("%d%d", &a, &b);
        v[a].push_back(b);
        ++d[b];
    }
}

void rezolvare()
{
    for (int i=1; i<=n; i++)
        if (!d[i])
            q.push(i);
    while (q.size())
    {
        int w=q.front();
        if (!a[w])
            printf("%d ",w);
        a[w]=1;
        for (vector <int>::iterator it=v[w].begin(); it!=v[w].end(); it++)
            q.push(*it);
        q.pop();
    }
}

int main()
{
    citire();
    freopen("sortaret.out","w",stdout);
    rezolvare();
    return 0;
}