#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
typedef vector<vector<int>> Graph;
const int inf = 1e9;
const int mod = 1e9 + 7;

int n, d;
VV c;
V sm;

bool update() {
    V cand = sm;
    sort(all(cand));
    reverse(all(cand));
    rep(i, n) {
        if (!c[i].empty()) {
            int M, m;
            M = (sm[i] == cand[0] ? cand[1] : cand[0]);
            m = min(cand.back(), sm[i] - c[i].back());
            if (M - m <= d) {
                sm[i] -= c[i].back();
                c[i].pop_back();
                return true;
            }
        }
    }
    return false;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    while (cin >> n >> d, n) {
        c.clear();
        c.resize(n);
        rep(i, n) {
            int m;
            cin >> m;
            rep(j, m) {
                int x;
                cin >> x;
                c[i].emplace_back(x);
            }
        }
        sm.clear();
        sm.resize(n);
        rep(i, n) {
            sm[i] = accumulate(all(c[i]), 0);
        }

        while (update()) ;

        cout << (*max_element(all(sm)) <= 0 ? "Yes" : "No") << endl;
    }
}