#include<iostream>
#include<cstdio>
#include<cmath>
#define N 1000000
#define Base 9
#define mod 998244353
#define int long long
#define w 14553391
using namespace std;
int W[7],t[Base+1],A[N+1],pw7[Base+1];
struct reads
{
  int d[N+1];
};
int n,k,sz,ps;
int read()
{
  char c=0;
  int sum=0;
  while (c<'0'||c>'9') c=getchar();
  while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
  return sum;
}
reads nw;
long long fast_pow(long long a,int b)
{
  if (b==0) return 1;
  if (b&1) return fast_pow(a*a%mod,b/2)*a%mod;
  else return fast_pow(a*a%mod,b/2);
}
void FWT(reads &a,int type)
{
  reads b;
  if (type==1)
    {
      for (int i=ps-1;i>=0;--i)
	{
	  for (int j=0;j<=sz;++j) b.d[j]=0;
	  for (int j=0;j<=sz;++j)
	    for (int k=0;k<=6;++k)
	      b.d[j-(j/pw7[i])%7*pw7[i]+k*pw7[i]]=(b.d[j-(j/pw7[i])%7*pw7[i]+k*pw7[i]]+a.d[j]*W[k*(j/pw7[i])%7]%mod)%mod;
	  for (int j=0;j<=sz;++j) a.d[j]=b.d[j];
	}
    }
  else
    {
      long long T=fast_pow(7,mod-2);
      for (int i=0;i<=ps-1;++i)
	{
	  for (int j=0;j<=sz;++j) b.d[j]=0;
	  for (int j=0;j<=sz;++j)
	    for (int k=0;k<=6;++k)
	      b.d[j-(j/pw7[i])%7*pw7[i]+k*pw7[i]]=(b.d[j-(j/pw7[i])%7*pw7[i]+k*pw7[i]]+a.d[j]*W[(7-k*(j/pw7[i])%7)%7]%mod)%mod;
	  for (int j=0;j<=sz;++j) a.d[j]=b.d[j]*T%mod;
	}
    }
  return;
}
signed main()
{
  n=read(),k=read(),sz=pw7[0]=1;
  for (int i=1;i<=Base;++i) pw7[i]=pw7[i-1]*7%mod;
  W[0]=1;
  for (int i=1;i<=6;++i) W[i]=W[i-1]*w%mod;
  for (int i=1;i<=n;++i)
    {
      A[i]=read();
      for (int j=0;j<=Base;++j) t[j]=0;
      for (int j=0;j<=log(A[i])/log(2);++j)
	if ((1ll<<j)&A[i])
	  ps=max(ps,j+1),t[j]=1;
      long long res=0,mul=1;
      for (int j=0;j<=Base;++j) res+=t[j]*mul,mul*=7;
      nw.d[res]++;
    }
  for (int i=1;i<=ps;++i) sz*=7;
  sz--;
  FWT(nw,1);
  for (int i=0;i<=sz;++i) nw.d[i]=fast_pow(nw.d[i],k);
  FWT(nw,-1);
  printf("%lld\n",nw.d[0]);
  return 0;
}