Problem:
Score : 800 points

Problem Statement

Given are N pairwise distinct non-negative integers A_1,A_2,\ldots,A_N.
Find the number of ways to choose a set of between 1 and K numbers (inclusive) from the given numbers so that the following two conditions are satisfied:

The bitwise AND of the chosen numbers is S.

The bitwise OR of the chosen numbers is T.

Constraints

1 \leq N \leq 50

1 \leq K \leq N

0 \leq A_i < 2^{18}

0 \leq S < 2^{18}

0 \leq T < 2^{18}

A_i \neq A_j (1 \leq i < j \leq N)

Input

Input is given from Standard Input in the following format:

N K S T
A_1 A_2 ... A_N

Output

Print the answer.

Sample Input 1

3 3 0 3
1 2 3

Sample Output 1

2

The conditions are satisfied when we choose \{1,2\} or \{1,2,3\}.

Sample Input 2

5 3 1 7
3 4 9 1 5

Sample Output 2

2

Sample Input 3

5 4 0 15
3 4 9 1 5

Sample Output 3

3

Solution in Rust (1.42.0) (judge verdict: Accepted)

use proconio::*;

#[fastout]
fn run() {
    input! {
        n: usize,
        k: usize,
        s: usize,
        t: usize,
        a: [usize; n],
    }
    let a: Vec<usize> = a.into_iter().filter(|a| a & s == s && a | t == t).collect();
    if a.len() == 0 {
        println!("0");
        return;
    }
    let n = a.len();
    let k = std::cmp::min(k, n);
    let w = 50usize;
    let mut binom = vec![vec![0i64; w + 1]; w + 1];
    binom[0][0] = 1;
    for i in 1..=w {
        binom[i][0] = 1;
        for j in 1..=i {
            binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];
        }
    }
    for i in 2..=w {
        for j in 2..=i {
            binom[i][j] += binom[i][j - 1];
        }
    }
    let mut bit = vec![];
    for i in 0usize..18 {
        if s >> i & 1 != t >> i & 1 {
            bit.push(i);
        }
    }
    let mut ans = 0i64;
    for (i, s) in a.iter().enumerate() {
        let mut cnt = vec![0; 1 << bit.len()];
        for &a in a.iter().skip(i + 1) {
            let mut v = 0;
            for (i, x) in bit.iter().enumerate() {
                if s >> x & 1 == a >> x & 1 {
                    v |= 1 << i;
                }
            }
            cnt[v] += 1;
        }
        for i in 0..bit.len() {
            for j in 0..(1 << bit.len()) {
                if j >> i & 1 == 1 {
                    cnt[j ^ (1 << i)] += cnt[j];
                }
            }
        }
        for (i, c) in cnt.into_iter().enumerate().filter(|p| p.1 > 0) {
            let sign = if i.count_ones() % 2 == 0 {1} else {-1};
            ans += sign * binom[c][std::cmp::min(k - 1, c)];
        }
    }
    println!("{}", ans);
}

fn main() {
    run();
}