#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <algorithm>
//http://www.infoarena.ro/problema/sortaret
using namespace std;
#define MAX 100020
int d[MAX];
pair <int,int> l[MAX];
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> v[MAX];
vector <int> ::iterator it;
queue <int> Q;
int main()
{   int k=0;
    int i,x,y,m,ind=1,n;
    in>>n>>m;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    Q.push(1);
    d[1]=1;
    while(!Q.empty())
    {   x=Q.front();
        Q.pop();
        for(it=v[x].begin();it!=v[x].end();++it)
            {if(d[*it]==0||d[*it]>d[x]+1) {
                    d[*it]=d[x]+1;
                Q.push(*it);}}
    }
    for(i=1;i<=n;i++)
    {
        l[i].first=d[i];
        l[i].second=i;
    }
    sort(l+1,l+n+1);
    for(i=1;i<=n;i++)
        out<<l[i].second<<" ";
    return 0;
}