//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
#define pb push_back
#define PB pop_back
#define fs first
//#define se second
#define sq(x) (x)*(x)
#define IINF (1<<29)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const int mod=2015;
int sz;
int mid[110][110];
struct matrix{int m[110][110];matrix(){memset(m,0,sizeof m);}void mul(const matrix &b){memset(mid,0,sizeof mid);for(int i=0;i<sz;i++){for(int j=0;j<sz;j++){for(int k=0;k<sz;k++){mid[i][j]=(mid[i][j]+m[i][k]*b.m[k][j]);}mid[i][j]%=mod;}}for(int i=0;i<sz;i++){for(int j=0;j<sz;j++){m[i][j]=mid[i][j];}}}void selfmul(){memset(mid,0,sizeof mid);for(int i=0;i<sz;i++){for(int j=0;j<sz;j++){for(int k=0;k<sz;k++){mid[i][j]=(mid[i][j]+m[i][k]*m[k][j]);}mid[i][j]%=mod;}}for(int i=0;i<sz;i++){for(int j=0;j<sz;j++){m[i][j]=mid[i][j];}}}
};
matrix qpow(matrix x,ll p){matrix ans;for(int i=0;i<sz;i++){ans.m[i][i]=1;}while(p>0){if(p&1) ans.mul(x);x.selfmul();p>>=1;}return ans;
}
const int maxm=1e5+300;
int T;
int n,m;
bool trans[60][60];
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("/home/files/CppFiles/out","w",stdout);cin>>T;while(T--){memset(trans,0,sizeof trans);scanf("%d%d",&n,&m);sz=n*2;for(int i=1;i<=n;i++){int k;scanf("%d",&k);for(int j=0;j<k;j++){int x;scanf("%d",&x);trans[i-1][x-1]=1;}}matrix tt;for(int i=0;i<n;i++){for(int j=0;j<n;j++){tt.m[i][j]=trans[i][j];}}for(int i=n;i<2*n;i++){int j=i-n;tt.m[i][j]=1;tt.m[i][i]=1;}matrix ans=qpow(tt,m);int sum=0;for(int i=n;i<2*n;i++){for(int j=0;j<n;j++)sum=(sum+ans.m[i][j])%mod;}printf("%d\n",(sum+1)%mod);}return 0;
}