#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

void solve(int n,int d){
    vector<int> a[n];
    vector<int> sum(n);
    int cnt=0;
    rep(i,n){
        int m;cin>>m;
        cnt+=m;
        rep(j,m){
            int x;
            cin>>x;
            sum[i]+=x;
            a[i].push_back(x);
        }
    }
    vector<int> lmi(n+1,inf),rmi(n+1,inf),lma(n+1,0),rma(n+1,0);
    rep(i,n){
        lma[i+1]=max(lma[i],sum[i]);
    }
    for(int i=n-1;i>=0;i--){
        rma[i]=max(rma[i+1],sum[i]);
    }
    while(cnt--){
        bool ok=false;
        rep(i,n){
            if(a[i].empty())continue;
            int nxt=sum[i]-a[i].back();
            int ma = max(lma[i],rma[i+1]);
            if(nxt+d>=ma){
                sum[i]=nxt;
                a[i].pop_back();
                ok=true;
                break;
            }
        }
        if(!ok){
            cout<<"No"<<endl;
            return;
        }
        rep(i,n){
            lma[i+1]=max(lma[i],sum[i]);
        }
        for(int i=n-1;i>=0;i--){
            rma[i]=max(rma[i+1],sum[i]);
        }
    }
    cout<<"Yes"<<endl;
}

int main(){
    int n,d;
    while(cin>>n>>d,n)solve(n,d);
    return 0;
}
