#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <math.h>
#include <iomanip>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 1000000007
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 10000000
vi G[50005];
int N,M,i,dg[50005],S[50005];
void topSort()
{
    for (i=1;i<=N;i++)
        if (dg[i]==0) S[++S[0]]=i;
    for (i=1;i<=S[0];i++)
    {
        int nod=S[i];
        for (vi::iterator it=G[nod].begin();it!=G[nod].end();it++)
        {
            dg[*it]--;
            if (dg[*it]==0) S[++S[0]]=*it;
        }
    }
    for (i=1;i<=S[0];i++) printf("%d ",S[i]);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&N,&M);
    while (M--)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        G[x].pb(y);
        dg[y]++;
    }
    topSort();
    return 0;
}