#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;
typedef pair<long long int, pll> lpll;


const long long int mod = 998244353;
const long long int INF = 1e18;
const long double PI=3.14159265358979323; 

long long int N,K,A[202000],B[200200],H,M;

vector<long long int>Edge[200200];
string S;
bool used[200200]={};
queue<long long int>que;
long long int res[200200]={};

int main(){
    cout << fixed << setprecision(18);
    cin>>N>>M;
    for(long long int i = 0; i < M; i++){
        cin>>A[i]>>B[i];
        Edge[A[i]-1].push_back(B[i]-1);
        Edge[B[i]-1].push_back(A[i]-1);
    }
    for(long long int i = 0; i <= N; i++){
        res[i]=-1;
    }
    que.push(0);
    //used[0]=true;
    while(!que.empty()){
        long long int fro=que.front();
        que.pop();

        if(used[fro]){continue;}

        used[fro]=true;

        for(long long int i = 0; i < Edge[fro].size(); i++){
            if(!used[Edge[fro][i]]){
                if(res[Edge[fro][i]]==-1)res[Edge[fro][i]]=fro;
                que.push(Edge[fro][i]);
            }
        }
    }
    cout<<"Yes"<<endl;
    for(long long int i = 1; i < N; i++){
        cout<<res[i]+1<<endl;
    }
}




Measured memory_bytes: 18696