#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
struct SCC{
    vector<vector<int>> g, gr;
    int n, k;
    vector<int> cmp, vs;
    vector<bool> used;
    void dfs(int x){
        used[x]=1;
        for(auto y:g[x]){
            if(!used[y]) dfs(y);
        }
        vs.push_back(x);
    }
    void rdfs(int v, int k){
        used[v]=1;
        cmp[v]=k;
        for(auto y:gr[v]){
            if(!used[y]) rdfs(y, k);
        }
    }
    SCC(const vector<vector<int>> &g):g(g), n(g.size()), cmp(n), used(n){
        gr.resize(n);
        for(int x=0; x<n; x++) for(auto y:g[x]) gr[y].push_back(x);
        for(int i=0; i<n; i++){
            if(!used[i]) dfs(i);
        }
        fill(used.begin(), used.end(), 0);
        k=0;
        for(int i=vs.size()-1; i>=0; i--){
            if(!used[vs[i]]) rdfs(vs[i], k++);
        }
    }
};
int a[100010];

int main()
{
    cout<<"No"<<endl;
    return 0;
    int n, m; cin>>n>>m;
    for(int i=0; i<n; i++){
        cin>>a[i]; a[i]--;
    }
    for(int i=0; i<n-2; i++){
        if(a[i]==a[i+2]){
            cout<<"No"<<endl;
            return 0;
        }
    }
    {
        vector<vector<int>> g(m);
        for(int i=0; i<n-1; i++){
            if(i&1){
                g[a[i+1]].push_back(a[i]);
            }else{
                g[a[i]].push_back(a[i+1]);
            }
        }
        SCC scc(g);
        if(scc.k==m){
            cout<<"Yes"<<endl;
            for(int i=0; i<m; i++){
                cout<<scc.cmp[i]+1;
                if(i<m-1) cout<<" ";
            }
            cout<<endl;
            return 0;
        }
    }
    {
        vector<vector<int>> g(m);
        for(int i=0; i<n-1; i++){
            if(!(i&1)){
                g[a[i+1]].push_back(a[i]);
            }else{
                g[a[i]].push_back(a[i+1]);
            }
        }
        SCC scc(g);
        if(scc.k==m){
            cout<<"Yes"<<endl;
            for(int i=0; i<m; i++){
                cout<<scc.cmp[i]+1;
                if(i<m-1) cout<<" ";
            }
            cout<<endl;
            return 0;
        }
    }
    cout<<"No"<<endl;
    return 0;
}