
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
#include<deque>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;
typedef deque<int> di;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}

int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};
string t = "ESWN";
signed main(void) {
    int i,j;
    int n,d;
    while(cin >> n >> d, n){
        vector<vi> v(n);
        vi sum(n);
        rep(i,n){
            int m;
            cin >> m;
            vi in(m);
            int s = 0;
            rep(j,m){
                cin >> in[j];
                s += in[j];
            }
            v[i] = in;
            sum[i] = s;
        }
        bool ans = true;
        while(ans){
            int ma = 0, mi = LINF;
            map<int,int> mp;
            rep(i,n)if(v[i].size()){
                ma = max(ma,sum[i]);
                mi = min(mi,sum[i]);
                mp[sum[i]]++;
            }
            if(ma == 0)break;
            if(ma-mi > d)ans = false;
            int sec = 0;
            if(mp[ma] >= 2){
                sec = ma;
            }else{
                rep(i,n)if(sum[i] != ma) sec = max(sec,sum[i]);
            }
            bool c = false;
            rep(i,n)if(v[i].size()){
                if(sum[i] == ma){
                    int ne = sum[i] - v[i].back();
                    if(sec - ne <= d){
                        sum[i] = ne;
                        v[i].pop_back();
                        c = true;
                        break;
                    }
                }else{
                    int ne = sum[i] - v[i].back();
                    if(ma - ne <= d){
                        sum[i] = ne;
                        v[i].pop_back();
                        c = true;
                        break;
                    }
                }
            }
            if(c == false) ans = false;
        }
        if(ans) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}

