#include <bits/stdc++.h>
#define DM 50005
#define pb push_back
#define pii pair<int,int>
#define x first
#define y second
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector<int>G[DM];
queue<int>Q;
int index[DM],n,m,a,b,currInd;
pii srt[DM];

bool cmp(pii a,pii b){
    if(a.y==b.y) return a.x<b.x;
    return a.y<b.y;
}

int main()
{
    fin>>n>>m;
    while(m--){
        fin>>a>>b;
        G[a].pb(b);
    }
    Q.push(1);
    while(!Q.empty()){
        int nod = Q.front();
        Q.pop();
        for(auto i:G[nod]){
            index[i]=++currInd;
            Q.push(i);
        }
    }
    for(int i=1;i<=n;++i) srt[i]={i,index[i]};
    sort(srt+1,srt+n+1,cmp);
    for(int i=1;i<=n;++i) fout<<srt[i].x<<" ";

    return 0;
}