Problem:
Problem B: For the Peace

This is a story of a world somewhere far from the earth. In this world, the land is parted into a
number of countries ruled by empires. This world is not very peaceful: they have been involved
in army race.

They are competing in production of missiles in particular. Nevertheless, no countries have
started wars for years. Actually they have a reason they can’t get into wars - they have
missiles much more than enough to destroy the entire world. Once a war would begin among
countries, none of them could remain.

These missiles have given nothing but scare to people. The competition has caused big financial
and psychological pressure to countries. People have been tired. Military have been tired. Even
empires have been tired. No one wishes to keep on missile production.

So empires and diplomats of all countries held meetings quite a few times toward renouncement
of missiles and abandon of further production. The meetings were quite difficult as they have
different matters. However, they overcame such difficulties and finally came to the agreement
of a treaty. The points include:

Each country will dispose all the missiles of their possession by a certain date.

The war potential should not be different by greater than a certain amount d among all
countries.

Let us describe more details on the second point. Each missile has its capability, which represents
how much it can destroy the target. The war potential of each country is measured simply by
the sum of capability over missiles possessed by that country. The treaty requires the difference
to be not greater than d between the maximum and minimum potential of all the countries.

Unfortunately, it is not clear whether this treaty is feasible. Every country is going to dispose
their missiles only in the order of time they were produced, from the oldest to the newest. Some
missiles have huge capability, and disposal of them may cause unbalance in potential.

Your task is to write a program to see this feasibility.

Input

The input is a sequence of datasets. Each dataset is given in the following format:

n d

m1 c1,1 ... c1,m1

...

mn cn,1 ... cn,mn

The first line contains two positive integers n and d, the number of countries and the tolerated
difference of potential (n ≤ 100, d ≤ 1000). Then n lines follow. The i-th line begins with a
non-negative integer mi, the number of the missiles possessed by the i-th country. It is followed
by a sequence of mi positive integers. The j-th integer ci,j represents the capability of the j-th
newest missile of the i-th country (ci,j ≤ 1000). These integers are separated by a single space.
Note that the country disposes their missiles in the reverse order of the given sequence.

The number of missiles is not greater than 10000. Also, you may assume the difference between
the maximum and minimum potential does not exceed d in any dataset.

The input is terminated by a line with two zeros. This line should not be processed.

Output

For each dataset, print a single line. If they can dispose all their missiles according to the treaty,
print "Yes" (without quotes). Otherwise, print "No".

Note that the judge is performed in a case-sensitive manner. No extra space or character is
allowed.

Sample Input

3 3
3 4 1 1
2 1 5
2 3 3
3 3
3 2 3 1
2 1 5
2 3 3
0 0

Output for the Sample Input

Yes
No

Solution in C++ (judge verdict: Accepted)

#include <iostream>
#include <set>
#include <utility>
#include <algorithm>
#include <vector>
#define llint long long
#define inf 1e18
#define mod 1000000007

using namespace std;
typedef pair<llint, llint> P;

llint n, d;
llint m[105];
llint c[105][10005], s[105][10005];
vector<llint> G[2000005];
bool used[2000005];
vector<llint> topo;

void tpsort(int v)
{
	used[v] = true;
	for(int i = 0; i < G[v].size(); i++){
		if(!used[G[v][i]]) tpsort(G[v][i]);
	}
	topo.push_back(v);
}

int main(void)
{
	while(1){
		cin >> n >> d;
		if(n == 0 && d == 0) break;
		
		for(int i = 1; i <= n; i++){
			cin >> m[i];
			for(int j = 1; j <= m[i]; j++){
				cin >> c[i][j];
				s[i][j] = s[i][j-1] + c[i][j];
			}
		}
		
		for(int i = 0; i < 2000005; i++) G[i].clear();
		
		llint M = 10005;
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m[i]; j++){
				G[i*M+j].push_back(i*M+(j-1));
			}
		}
		for(int i = 1; i <= n; i++){
			for(int j = 0; j < m[i]; j++){
				llint S = s[i][j];
				for(int k = 1; k <= n; k++){
					if(i == k) continue;
					llint p = upper_bound(s[k], s[k]+m[k]+1, S+d) - s[k] - 1;
					G[k*M+p].push_back(i*M+j);
				}
			}
		}
		
		topo.clear();
		for(int i = 0; i < 2000005; i++) used[i] = false;
		for(int i = 0; i < 2000005; i++) if(!used[i]) tpsort(i);
		reverse(topo.begin(), topo.end());
		
		for(int i = 0; i < 2000005; i++) used[i] = false;
		for(int i = 0; i < topo.size(); i++){
			int v = topo[i];
			used[v] = true;
			for(int j = 0; j < G[v].size(); j++){
				if(used[G[v][j]]){
					cout << "No" << endl;
					goto end;
				}
			}
		}
		cout << "Yes" << endl;
		end:;
	}
	return 0;
}