import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 998244353;
enum M = 1 << 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt() / 2;
      int K = readInt();
      const X = readInt();
      const Y = readInt();
      auto A = new int[K];
      foreach (k; 0 .. K) {
        A[k] = readInt();
      }
      A = A.sort.uniq.array;
      K = cast(int)(A.length);
      
      long solve(int n, int ini) {
        auto fs = new long[M];
        void dfs(int i, int x, int last) {
          if (i == n) {
            ++fs[x];
          } else {
            foreach (k; 0 .. K) {
              if (k != last) {
                dfs(i + 1, x ^ A[k], k);
              }
            }
          }
        }
        dfs(0, 0, ini);
        debug {
          writeln("fs = ", fs[0 .. 16]);
        }
        long ret;
        foreach (x; 0 .. M) foreach (y; 0 .. M) {
          if (X <= (x ^ y) && (x ^ y) <= Y) {
            ret += fs[x] * fs[y];
          }
        }
        return ret;
      }
      
      long ans;
      ans += solve(N, -1);
      foreach (k; 0 .. K) {
        ans -= solve(N - 1, k);
      }
      ans %= MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}