#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
string solve(int N, int D){
  int m[100];
  vector<int> c[100];
  vector<int> sum[100];
  int cnt = 0;
  REP(i, N){
    cin>>m[i];
    cnt += m[i];
    c[i] = vector<int>(m[i]);
    sum[i] = vector<int>(m[i] + 1);
    REP(j, m[i]) cin>>c[i][j];
    REP(j, m[i]) sum[i][j + 1] = sum[i][j] + c[i][j];
  }
  if(N == 1) return "Yes";
  REP(iter, cnt){ //10000
    vector<int> v(N);
    REP(i, N) {
      v[i] = sum[i][m[i]];
    }
    int di = -1;
    sort(v.begin(), v.end());
    REP(i, N)if(m[i] > 0){
      int Max = v.back();
      int Min = v.front();
      if(Max == sum[i][m[i]]) Max = v[v.size() - 2];
      else if(Min == sum[i][m[i]]) Min = v[1];
      if(Max - min(Min, sum[i][m[i] - 1]) <= D){
        di = i;
        break;
      }
    }
    if(di == -1) return "No";
    else m[di]--;
  }
  return "Yes";
}

int main(){
  int N, D;
  while(cin>>N>>D && N){
    cout<<solve(N, D)<<endl;
  }
  return 0;
}