#include <bits/stdc++.h>
#define FASTIO
//using namespace std;

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
        void operator()(const Args&... args) const { print(args...); }
        template <typename T>
        void pvec(const T& vec, size_t sz) const {
            for (size_t i = 0; i < sz; i++)
                std::cout << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
        void pmat(const T& mat, size_t h, size_t w) {
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    std::cout << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { std::cout << term; }
        void print_rest() const { std::cout << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { std::cout << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { std::cout << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints prints;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

class SccGraph {
private:
    int n;
    std::vector<std::vector<int>> g, rg;

public:
    SccGraph(int n) : n(n), g(n), rg(n) {}
    void add_edge(int a, int b) {
        g[a].emplace_back(b);
        rg[b].emplace_back(a);
    }
    std::vector<std::vector<int>> scc() {
        std::vector<std::vector<int>> res;
        std::vector<int> vs;
        vs.reserve(n);
        std::vector<bool> used(n);
        auto dfs1 = [&](auto&& self, int idx) -> void {
            used[idx] = true;
            for (const auto& v : g[idx])
                if (!used[v]) self(self, v);
            vs.emplace_back(idx);
        };
        auto dfs2 = [&](auto&& self, int idx) -> void {
            used[idx] = true;
            res.back().emplace_back(idx);
            for (const auto& v : rg[idx])
                if (!used[v]) self(self, v);
        };
        for (int i = 0; i < n; i++) {
            if (!used[i]) dfs1(dfs1, i);
        }
        used.assign(n, false);
        for (int i = n - 1; i >= 0; i--) {
            if (!used[vs[i]]) {
                res.emplace_back();
                dfs2(dfs2, vs[i]);
            }
        }
        return res;
    }
};

class TwoSat {
private:
    int n;
    SccGraph scc_graph;
    std::vector<int> scc_ord;

public:
    TwoSat(int n) : n(n), scc_graph(n * 2), scc_ord(n * 2) {}
    void add_clause(int i, bool f, int j, bool g) {
        scc_graph.add_edge((f ? i + n : i), (!g ? j + n : j));
        scc_graph.add_edge((g ? j + n : j), (!f ? i + n : i));
    }
    // complexity : O(n + m) (m : the number of clauses)
    bool satisfiable() {
        auto scc_res = scc_graph.scc();
        const int scc_sz = static_cast<int>(scc_res.size());
        for (int i = 0; i < scc_sz; i++)
            for (const auto& v : scc_res[i])
                scc_ord[v] = i;
        bool res = true;
        for (int i = 0; i < n; i++) {
            if (scc_ord[i] == scc_ord[i + n]) {
                res = false;
                break;
            }
        }
        return res;
    }
    // complexity : O(n)
    std::vector<bool> answer() {
        std::vector<bool> res(n);
        for (int i = 0; i < n; i++)
            if (scc_ord[i] > scc_ord[i + n]) res[i] = true;
        return res;
    }
};

void solve() {
    int N, D;
    std::cin >> N >> D;
    Vl xs(N), ys(N);
    for (ll i = 0; i < N; i++) {
        std::cin >> xs[i] >> ys[i];
    }
    TwoSat ts(N);
    for (ll i = 0; i < N; i++) {
        for (ll j = i + 1; j < N; j++) {
            if (abs(xs[i] - xs[j]) < D) ts.add_clause(i, false, j, false);
            if (abs(xs[i] - ys[j]) < D) ts.add_clause(i, false, j, true);
            if (abs(ys[i] - xs[j]) < D) ts.add_clause(i, true, j, false);
            if (abs(ys[i] - ys[j]) < D) ts.add_clause(i, true, j, true);
        }
    }
    bool ok = ts.satisfiable();
    if (!ok) {
        prints()("No");
        return;
    }
    auto res = ts.answer();
    prints()("Yes");
    for (ll i = 0; i < N; i++) {
        prints()(res[i] ? xs[i] : ys[i]);
    }
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}

Measured memory_bytes: 3868