#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn = 1000000 + 10;
ll a[105],v[10][105],b[maxn],c[maxn],j;
void dfs(ll s[],ll & num,ll begin,ll end,ll sum)
{
if(begin == end + 1)
{
s[ ++num ] = sum;
return ;
}
for(ll i = 1; i <= a[begin] + 1; i++)
dfs(s,num,begin + 1,end,sum + v[begin][i]);
}
int main(){
ll k,M;
while(cin>>k>>M)
{
ll t1=0,t2=0,cnt=0;
for(ll i=1;i<=k;i++){
cin>>a[i];
for( j=1;j<=a[i];j++)
cin>>v[i][j];
v[i][j] = 0;
}
ll mid=1+(k-1)/2;
dfs(b,t1,1,mid,0);//前半段
dfs(c,t2,mid+1,k,0);//后半段
sort(c+1,c+t2+1);//后半段排序
for(ll i = 1; i <= t1; i++)
cnt += c + t2 + 1 - upper_bound(c + 1,c + t2 + 1,M - b[i]);//统计符合的个数
cout<<cnt<<endl;
}
return 0;
}
/**深搜一道很经典的题,而且还用到了折半枚举和二分查找,挺有意思的题!!!*/