//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;



#include <unistd.h>

struct Scanner {
    int fd = -1;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += ::read(fd, line + ed, (1 << 15) - ed);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) {
            bool sep = false;
            for (size_t i = st; i < ed; i++) {
                if (isspace(line[i])) {
                    sep = true;
                    break;
                }
            }
            if (!sep) reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] & 0xf);
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* fp) : fd(fileno(fp)) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

// bit op
int popcnt(uint x) { return __builtin_popcount(x); }
int popcnt(ull x) { return __builtin_popcountll(x); }
int bsr(uint x) { return 31 - __builtin_clz(x); }
int bsr(ull x) { return 63 - __builtin_clzll(x); }
int bsf(uint x) { return __builtin_ctz(x); }
int bsf(ull x) { return __builtin_ctzll(x); }

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

int main() {
    int n, k, s, t;
    n = 50;
    k = 50;
    s = 0;
    t = (1 << 18) - 1;
    sc.read(n, k, s, t);

    // s == 1, t == 0
    if (s & ~t) {
        pr.writeln(0);
        return 0;
    }

    V<int> v;
    for (int i = 0; i < n; i++) {
        int x;
        x = 0;
        sc.read(x);

        // x == 0, s == 1
        if (~x & s) continue;
        // x == 1, t == 0
        if (x & ~t) continue;
        v.push_back(x);
    }
    n = int(v.size());

    V<int> idxs;
    for (int i = 0; i < 18; i++) {
        // s == 0, t == 1
        if (s & (1 << i)) continue;
        if (!(t & (1 << i))) continue;
        idxs.push_back(i);
    }

    int l = int(idxs.size());

    {
        V<int> v2;
        for (auto x: v) {
            int nx = 0;
            for (int i = 0; i < l; i++) {
                int p = idxs[i];
                if (x & (1 << p)) nx += 1 << i;
            }
            v2.push_back(nx);
        }
        v = v2;
    }

             ;
    V<ull> f0(l), f1(l);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < l; j++) {
            if (v[i] & (1 << j)) {
                f1[j] |= (1ULL << i);
            } else {
                f0[j] |= (1ULL << i);
            }
        }
    }
    VV<ll> C(55, V<ll>(55));
    C[0][0] = 1;
    for (int i = 1; i < 55; i++) {
        C[i][0] = 1;
        for (int j = 1; j < 55; j++) {
            C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
        }
    }

    V<ll> cnt(n + 1);
    for (int i = 0; i <= n; i++) {
        for (int j = 1; j <= min(i, k); j++) {
            cnt[i] += C[i][j];
        }
    }
            ;
    auto dfs = [&](auto self, ull f, int p) -> ll {
        if (p == l) {
            return cnt[popcnt(f)];
        }
        ll ans = 0;
        ans -= self(self, f & f0[p], p + 1);
        ans -= self(self, f & f1[p], p + 1);
        ans += self(self, f, p + 1);
        return ans;
    };
    pr.writeln(dfs(dfs, (1ULL << n) - 1, 0));
    return 0;
}


Measured memory_bytes: 3692