#include <iostream>
#include <cstdio>
#include <vector>
#include <deque>
#define N 50001
using namespace std;
vector <int> v[N];
deque <int> q;
int n,m,g[N],x,y,i,s[N];
int main()
{
    vector <int>::iterator it;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(;m;m--)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        g[y]++;
    }
    for(i=1;i<=n;i++)
        if(!g[i])   q.push_back(i);
    for(;q.size();)
    {
        x=q.front();
        for(it=v[x].begin();it!=v[x].end();it++)
            {
                g[*it]--;
                if(!g[*it]) q.push_back(*it);
            }
        s[++m]=x;
        q.pop_front();
    }
    for(i=1;i<=n;i++)
        printf("%d ",s[i]);

    return 0;
}