#line 1 "a.cpp"
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#line 3 "/home/kotatsugame/library/math/modint.cpp"
#include<utility>
template<int m>
struct modint{
	unsigned int x;
	constexpr modint()noexcept:x(){}
	template<typename T>
	constexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}
	constexpr unsigned int val()const noexcept{return x;}
	constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}
	constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}
	constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}
	constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}
	constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}
	constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}
	constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}
	constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}
	constexpr modint operator+()const noexcept{return*this;}
	constexpr modint operator-()const noexcept{return modint()-*this;}
	constexpr modint pow(long long n)const noexcept
	{
		if(n<0)return pow(-n).inv();
		modint x=*this,r=1;
		for(;n;x*=x,n>>=1)if(n&1)r*=x;
		return r;
	}
	constexpr modint inv()const noexcept
	{
		int s=x,t=m,x=1,u=0;
		while(t)
		{
			int k=s/t;
			s-=k*t;
			swap(s,t);
			x-=k*u;
			swap(x,u);
		}
		return modint(x);
	}
	friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}
	friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}
	friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}
	friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}
	friend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}
	friend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}
	friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}
	friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}
};
#line 6 "a.cpp"
using mint=modint<998244353>;
int N,K,X,Y;
mint ans;
main()
{
	cin>>N>>K>>X>>Y;
	vector<int>A(K);
	for(int i=0;i<K;i++)cin>>A[i];
	sort(A.begin(),A.end());
	A.erase(unique(A.begin(),A.end()),A.end());
	if(A.size()==1);
	else if(N==2)
	{
		for(int a:A)for(int b:A)if(a!=b)
		{
			if(X<=(a^b)&&(a^b)<=Y)ans++;
		}
	}
	else if(N==4)
	{
		vector<mint>all(1024);
		for(int a:A)for(int b:A)if(a!=b)all[a^b]++;
		for(int i=0;i<1024;i++)for(int j=0;j<1024;j++)if(X<=(i^j)&&(i^j)<=Y)ans+=all[i]*all[j];
		all[0]=A.size();
		for(int i=0;i<1024;i++)if(X<=i&&i<=Y)ans-=all[i]*(A.size()-2+!i);
	}
	else
	{
		vector<vector<mint> >now(A.size(),vector<mint>(1024));
		for(int i=0;i<A.size();i++)now[i][A[i]]=1;
		for(int i=1;i<N;i++)
		{
			vector<vector<mint> >nxt(A.size(),vector<mint>(1024));
			for(int i=0;i<A.size();i++)for(int j=0;j<A.size();j++)if(i!=j)
			{
				for(int k=0;k<1024;k++)nxt[j][k^A[j]]+=now[i][k];
			}
			now.swap(nxt);
		}
		for(int i=0;i<A.size();i++)for(int j=X;j<1024&&j<=Y;j++)ans+=now[i][j];
	}
	cout<<ans<<endl;
}