#pragma region kyopro_template #include #define pb push_back #define eb emplace_back #define fi first #define se second #define each(x, v) for (auto &x : v) #define all(v) (v).begin(), (v).end() #define sz(v) ((int)(v).size()) #define mem(a, val) memset(a, val, sizeof(a)) #define ini(...) \ int __VA_ARGS__; \ in(__VA_ARGS__) #define inl(...) \ long long __VA_ARGS__; \ in(__VA_ARGS__) #define ins(...) \ string __VA_ARGS__; \ in(__VA_ARGS__) #define inc(...) \ char __VA_ARGS__; \ in(__VA_ARGS__) #define in2(s, t) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i]); \ } #define in3(s, t, u) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i]); \ } #define in4(s, t, u, v) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i], v[i]); \ } #define rep(i, N) for (long long i = 0; i < (long long)(N); i++) #define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--) #define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++) #define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--) using namespace std; void solve(); using ll = long long; template using V = vector; using vi = vector; using vl = vector; using vvi = vector>; using vd = V; using vs = V; using vvl = vector>; using P = pair; using vp = vector

; using pii = pair; using vpi = vector>; constexpr int inf = 1001001001; constexpr long long infLL = (1LL << 61) - 1; template inline bool amin(ll &x, U y) { return (y < x) ? (x = y, true) : false; } template inline bool amax(ll &x, U y) { return (x < y) ? (x = y, true) : false; } template ll ceil(ll a, U b) { return (a + b - 1) / b; } constexpr ll TEN(int n) { ll ret = 1, x = 10; while (n) { if (n & 1) ret *= x; x *= x; n >>= 1; } return ret; } template ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(ll &t, U &... u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const ll &t, const U &... u) { cout << t; if (sizeof...(u)) cout << " "; out(u...); } template void die(ll x) { out(x); exit(0); } #ifdef NyaanDebug #include "NyaanDebug.h" #define trc(...) \ do { \ cerr << #__VA_ARGS__ << " = "; \ dbg_out(__VA_ARGS__); \ } while (0) #define trca(v, N) \ do { \ cerr << #v << " = "; \ array_out(v, N); \ } while (0) #define trcc(v) \ do { \ cerr << #v << " = {"; \ each(x, v) { cerr << " " << x << ","; } \ cerr << "}" << endl; \ } while (0) #else #define trc(...) #define trca(...) #define trcc(...) int main() { solve(); } #endif struct IoSetupNya { IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetupnya; inline int popcnt(unsigned long long a) { return __builtin_popcountll(a); } inline int lsb(unsigned long long a) { return __builtin_ctzll(a); } inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); } template inline int getbit(ll a, int i) { return (a >> i) & 1; } template inline void setbit(ll &a, int i) { a |= (1LL << i); } template inline void delbit(ll &a, int i) { a &= ~(1LL << i); } template int lb(const vector &v, const ll &a) { return lower_bound(begin(v), end(v), a) - begin(v); } template int ub(const vector &v, const ll &a) { return upper_bound(begin(v), end(v), a) - begin(v); } template vector mkrui(const vector &v) { vector ret(v.size() + 1); for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i]; return ret; }; template vector mkuni(const vector &v) { vector ret(v); sort(ret.begin(), ret.end()); ret.erase(unique(ret.begin(), ret.end()), ret.end()); return ret; } template vector mkord(int N, F f) { vector ord(N); iota(begin(ord), end(ord), 0); sort(begin(ord), end(ord), f); return ord; } template vector mkiota(int N) { vector ret(N); iota(begin(ret), end(ret), 0); return ret; } vector mkinv(vi &v) { vi inv(v.size()); for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i; return inv; } #pragma endregion constexpr int MOD = /** 998244353; //*/ 1000000007; template struct Matrix { using Array = array, H>; Array A; Matrix() : A({}) {} int height() const { return H; } int width() const { return W; } inline const array &operator[](int k) const { return A[k]; } inline array &operator[](int k) { return A[k]; } static Matrix I() { assert(H == W); Matrix mat; for (int i = 0; i < H; i++) mat[i][i] = 1; return (mat); } Matrix &operator+=(const Matrix &B) { for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) A[i][j] += B[i][j]; return (*this); } Matrix &operator-=(const Matrix &B) { for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) A[i][j] -= B[i][j]; return (*this); } Matrix &operator*=(const Matrix &B) { assert(H == W); Matrix C; for (int i = 0; i < H; i++) for (int j = 0; j < H; j++) for (int k = 0; k < H; k++) C[i][j] = (C[i][j] + A[i][k] * B[k][j]); A.swap(C.A); return (*this); } Matrix &operator^=(long long k) { Matrix B = Matrix::I(); while (k > 0) { if (k & 1) B *= *this; *this *= *this; k >>= 1LL; } A.swap(B.A); return (*this); } Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); } Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); } Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); } Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); } friend ostream &operator<<(ostream &os, Matrix &p) { for (int i = 0; i < H; i++) { os << "["; for (int j = 0; j < W; j++) { os << p[i][j] << (j + 1 == W ? "]\n" : ","); } } return (os); } T determinant() { Matrix B(*this); assert(H == W); T ret = 1; for (int i = 0; i < H; i++) { int idx = -1; for (int j = i; j < W; j++) { if (B[j][i] != 0) idx = j; } if (idx == -1) return (0); if (i != idx) { ret *= -1; swap(B[i], B[idx]); } ret *= B[i][i]; T vv = B[i][i]; for (int j = 0; j < W; j++) { B[i][j] /= vv; } for (int j = i + 1; j < H; j++) { T a = B[j][i]; for (int k = 0; k < W; k++) { B[j][k] -= B[i][k] * a; } } } return (ret); } }; template struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if ((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int)(1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt(t); return (is); } static constexpr int get_mod() { return mod; } }; using mint = ModInt; using vm = vector; using mat = Matrix; void solve() { inl(N,D); vl a(N); in(a); vl b(a); sort(all(b)); rep(i,N){ int x = ub(b, a[i] - D); out(x); } }