#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;

#define pb push_back

vector <int> sol;
vector <int> a[50001];
queue  <int> q;
int viz[50001];
int gr[50001];
int n,m,x,y,nd;

void citire()
{
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        gr[y]++;
        a[x].pb(y);
    }
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    nd=n;
    while(nd)
    {
        for(int i=1;i<=n;i++)
            if(gr[i]==0 && viz[i]==0)
              sol.pb(i),q.push(i),nd--,viz[i]=1;
        while(!(q.empty()))
        {
            int r=q.front();
            q.pop();
            for(int i=0;i<a[r].size();i++)
                gr[a[r][i]]--;
        }
    }
    for(int i=0;i<n;i++)
        printf("%d ",sol[i]);

    return 0;
}