#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize ("Ofast")
#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
using ll = long long;

#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked _fwrite_nolock
#define fread_unlocked _fread_nolock
#endif
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif

// #define USE_FREAD
#ifdef USE_FREAD
struct Input {
	static constexpr size_t MAX_SIZE = 4400019;
	char buf[MAX_SIZE];
	size_t i, end;
	Input() {
		i = 0;
		end = fread_unlocked(buf, 1, MAX_SIZE, stdin);
	}
	inline int gc() {
		if (i < end) {
			return buf[i++];
		} else {
			return EOF;
		}
	}
} in;
#define gc in.gc
#else
#define gc getchar_unlocked
#endif  // USE_FREAD

// #define USE_FWRITE
#ifdef USE_FWRITE
struct Output {
	static constexpr size_t MAX_SIZE = 4000009;
	char buf[MAX_SIZE];
	size_t i = 0;
	void pc(int c) {
		buf[i++] = c;
	}
	~Output() {
		fwrite_unlocked(buf, 1, i, stdout);
	}
} out;
#define pc out.pc
#else
#define pc putchar_unlocked
#endif  // USE_FWRITE

inline void ini(int& v) noexcept {
	v = 0;
	char c = gc();
	bool f = false;
	if (c == '-') {
		f = true;
		c = gc();
	}
	for (; '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0');
	if (f) v = -v;
}
inline void inui(int& v) noexcept {
	v = 0;
	for (char c = gc(); '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0');
}
inline void inl(ll& v) noexcept {
	v = 0;
	char c = gc();
	bool f = false;
	if (c == '-') {
		f = true;
		c = gc();
	}
	for (; '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0');
	if (f) v = -v;
}
inline void inul(ll& v) noexcept {
	v = 0;
	for (char c = gc(); '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0');
}
inline void ins(char* c, int n) noexcept {
	while (n--) {
		*c = gc();
		++c;
	}
}
inline void puti(int v) noexcept {
	if (v < 0) pc('-'), v = -v;
	char b[10];
	int n = 0;
	while (v) b[n++] = '0' + v % 10, v /= 10;
	if (!n) b[n++] = '0';
	while (n--) pc(b[n]);
}
inline void putui(int v) noexcept {
	char b[10];
	int n = 0;
	while (v) b[n++] = '0' + v % 10, v /= 10;
	if (!n) b[n++] = '0';
	while (n--) pc(b[n]);
}
inline void putl(ll v) noexcept {
	if (v < 0) pc('-'), v = -v;
	char b[20];
	int n = 0;
	while (v) b[n++] = '0' + v % 10, v /= 10;
	if (!n) b[n++] = '0';
	while (n--) pc(b[n]);
}
inline void putul(ll v) noexcept {
	char b[20];
	int n = 0;
	while (v) b[n++] = '0' + v % 10, v /= 10;
	if (!n) b[n++] = '0';
	while (n--) pc(b[n]);
}

// ---------------------------------------------------------------- //

namespace atcoder {
	namespace internal {
		template <class E> struct csr {
			std::vector<int> start;
			std::vector<E> elist;
			csr(int n, const std::vector<std::pair<int, E>>& edges) : start(n + 1), elist(edges.size()) {
				for (auto e : edges) {
					start[e.first + 1]++;
				}
				for (int i = 1; i <= n; i++) {
					start[i] += start[i - 1];
				}
				auto counter = start;
				for (auto e : edges) {
					elist[counter[e.first]++] = e.second;
				}
			}
		};
		struct scc_graph {
		public:
			scc_graph(int n) : _n(n) {}

			int num_vertices() {
				return _n;
			}

			void add_edge(int from, int to) {
				edges.push_back({from, {to}});
			}

			// @return pair of (# of scc, scc id)
			std::pair<int, std::vector<int>> scc_ids() {
				auto g = csr<edge>(_n, edges);
				int now_ord = 0, group_num = 0;
				std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);
				visited.reserve(_n);
				auto dfs = [&](auto self, int v) -> void {
					low[v] = ord[v] = now_ord++;
					visited.push_back(v);
					for (int i = g.start[v]; i < g.start[v + 1]; i++) {
						auto to = g.elist[i].to;
						if (ord[to] == -1) {
							self(self, to);
							low[v] = std::min(low[v], low[to]);
						} else {
							low[v] = std::min(low[v], ord[to]);
						}
					}
					if (low[v] == ord[v]) {
						while (true) {
							int u = visited.back();
							visited.pop_back();
							ord[u] = _n;
							ids[u] = group_num;
							if (u == v) break;
						}
						group_num++;
					}
				};
				for (int i = 0; i < _n; i++) {
					if (ord[i] == -1) dfs(dfs, i);
				}
				for (auto& x : ids) {
					x = group_num - 1 - x;
				}
				return {group_num, ids};
			}

			std::vector<std::vector<int>> scc() {
				auto ids = scc_ids();
				int group_num = ids.first;
				std::vector<int> counts(group_num);
				for (auto x : ids.second) counts[x]++;
				std::vector<std::vector<int>> groups(ids.first);
				for (int i = 0; i < group_num; i++) {
					groups[i].reserve(counts[i]);
				}
				for (int i = 0; i < _n; i++) {
					groups[ids.second[i]].push_back(i);
				}
				return groups;
			}

		private:
			int _n;
			struct edge {
				int to;
			};
			std::vector<std::pair<int, edge>> edges;
		};
	}  // namespace internal
}  // namespace atcoder

int n, d;
int x[1001], y[1001];
bool ans[1001];

int main() {
	inui(n);
	inui(d);

	atcoder::internal::scc_graph scc(2 * n);
	auto add_clause = [&](int i, bool f, int j, bool g) {
		scc.add_edge(2 * i + (f ? 0 : 1), 2 * j + (g ? 1 : 0));
		scc.add_edge(2 * j + (g ? 0 : 1), 2 * i + (f ? 1 : 0));
	};

	rep(i, n) {
		inui(x[i]);
		inui(y[i]);
	};
	rep(i, n) FOR(j, i + 1, n) {
		if (abs(x[i] - x[j]) < d) {
			add_clause(i, true, j, true);
		}
		if (abs(x[i] - y[j]) < d) {
			add_clause(i, true, j, false);
		}
		if (abs(y[i] - x[j]) < d) {
			add_clause(i, false, j, true);
		}
		if (abs(y[i] - y[j]) < d) {
			add_clause(i, false, j, false);
		}
	}

	auto id = scc.scc_ids().second;
	for (int i = 0; i < n; i++) {
		if (id[2 * i] == id[2 * i + 1]) {
			pc('N');
			pc('o');
			return 0;
		}
		if (id[2 * i] < id[2 * i + 1]) ans[i] = true;
	}

	pc('Y');
	pc('e');
	pc('s');
	pc('\n');
	rep(i, n) {
		putui(ans[i] ? y[i] : x[i]);
		pc('\n');
	}
}

Measured memory_bytes: 3132