#include <fstream>
#include <algorithm>
#include <vector>
#define nmax 50001

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector<int> v[nmax];
int n,m;

int t[nmax];
int viz[nmax];

void read()
{
    int x,y;
    int i;
    fin>>n>>m;
    for(i=1; i<=m; i++)
       {
           fin>>x>>y;
           v[x].push_back(y);
       }
}

void dfs(int x)
{
    viz[x]=1;
    int ct=v[x].size();
    int i;
    for(i=0; i<ct; i++)
       {
           int val=v[x][i];
           if(!viz[val]) { t[val]=t[x]+1; dfs(val);}
       }
}

struct nod
{
    int n,t;
};

nod nn[nmax];

bool cmp(nod n1,nod n2)
{
    return n1.t<n2.t;
}

int main()
{
    read();
    t[1]=0;
    dfs(1);
    int i;
    for(i=1; i<=n; i++)
        {
            nn[i].n=i;
            nn[i].t=t[i];
        }
    sort(nn+1,nn+n+1,cmp);
    for(i=1; i<=n; i++)
         {fout<<nn[i].n<<" ";}
    return 0;
}