#include <fstream>
#include <vector>
#include <algorithm>
#define DIM 50010
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
vector <int> L[DIM];
int n,m,x,y,a,b,r,i,k,v[DIM],sol[DIM],c[DIM],ok,j;

void bfs(int nod){
    v[nod]=1;
    int p=1;
    int u=1;
    c[1]=nod;
    while(p<=u){
        int nodc=c[p];
        sol[++k]=nodc;
        for(int i=0;i<L[nodc].size();i++){
            int nodv=L[nodc][i];
            if(v[nodv]==0){
                ++u;
                c[u]=nodv;
            }
        }
        ++p;
    }

}


int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        ok=1;
        for(j=0;j<L[x].size();j++){
            if(L[x][j]==y)
                ok=0;
        }
        if(ok)
            L[x].push_back(y);
    }
    for(i=1;i<=n;i++){
        sort(L[i].begin(), L[i].end());
    }
    bfs(1);
    for(i=1;i<=k;i++){
        fout<<sol[i]<<" ";
    }
}