AOJ2176.cpp

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

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3") 
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x) 
#endif
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);

/* -----  2019/04/29  Problem: AOJ 2176 / Link: https://onlinejudge.u-aizu.ac.jp/challenges/search/volumes/2176  ----- */


int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	while (1) {
		LL N, D; cin >> N >> D;
		if (!(N || D))break;

		VVI a(N);
		VL asum(N);
		LL X = 0;
		FOR(i, 0, N) {
			int M; cin >> M;
			X += M;
			FOR(j, 0, M) {
				int P; cin >> P;
				a[i].push_back(P);
				asum[i] += P;
			}
			reverse(ALL(a[i])); // ひどい
		}
		VI aid(N);
		bool ans = true;
		while (X--) {
			bool ok = false;
			FOR(i, 0, N) {
				if (aid[i] == SZ(a[i])) continue;

				LL mi = INF, ma = -1;
				FOR(j, 0, N) {
					if (i != j) {
						mi = min(mi, asum[j]);
						ma = max(ma, asum[j]);
					}
					else {
						mi = min(mi, asum[j] - a[j][aid[j]]);
						ma = max(ma, asum[j] - a[j][aid[j]]);
					}
				}
				if (ma - mi > D) continue;
				else {
					ok = true;
					asum[i] -= a[i][aid[i]];
					aid[i]++;
					break;
				}
			}
			if (!ok) {
				ans = false;
				break;
			}
		}
		auto print_yesno = [](LL yes, int mode = 0) {
			if (mode == 0) {
				cout << (yes ? "yes" : "no") << endl;
			}
			else if (mode == 1) {
				cout << (yes ? "Yes" : "No") << endl;
			}
			else if (mode == 2) {
				cout << (yes ? "YES" : "NO") << endl;
			}
			else assert(0);
		};
		print_yesno(ans, 1);
	}
	return 0;
}