#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <bitset>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <cmath>
#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 666013
#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 1005
int N,M,i,x,y,dg[50005];
vi G[50005],S;
vi::iterator it;
queue <int> Q;
void topsort()
{
    for (i=1;i<=N;i++) if (dg[i]==0) Q.push(i);
    int nod;
    while (!Q.empty())
    {
        nod=Q.front();
        S.pb(nod);
        for (it=G[nod].begin();it!=G[nod].end();it++)
        {
            dg[*it]--;
            if (dg[*it]==0) Q.push(*it);
        }
        Q.pop();
    }
    for (it=S.begin();it!=S.end();it++) printf("%d ",*it);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&N,&M);
    while (M--)
    {
        scanf("%d %d",&x,&y);
        G[x].pb(y);
        dg[y]++;
    }
    topsort();
    return 0;
}