#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <list>
#include <queue>
//#include <conio.h>
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define newl printf("\n")
using namespace std;
int n,m,dg[50005];
vector <int> G[50005],sol;
vector <int>::iterator it;
queue <int> Q;
void topSort()
{
    for (int i=1;i<=n;i++)
        if (!dg[i]) Q.push(i);
    while (!Q.empty())
    {
        int nod=Q.front();
        for (it=G[nod].begin();it!=G[nod].end();it++)
        {
            dg[*it]--;
            if (dg[*it]==0) Q.push(*it);
        }
        sol.pb(nod);
        Q.pop();
    }
    for (int i=0;i<sol.size();i++)
        printf("%d ",sol[i]);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    int a,b;
    while (m--)
    {
        scanf("%d %d",&a,&b);
        G[a].pb(b);
        dg[b]++;
    }
    topSort();
    return 0;
}