#include <stdio.h>
typedef long long ll;

const int MAXN = 1e5 + 10, MOD = 1e9 + 7;
int n, P, a[MAXN];
ll ans, f[MAXN][4];

int Pow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = ((ll)res * a) % MOD;
        b >>= 1;
        a = ((ll)a * a) % MOD;
    }
    return res;
}

int main() {
    int X, Y;
    scanf("%d%d%d", &n, &X, &Y);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
    }
    P = ((ll)X * Pow(Y, MOD - 2)) % MOD;
    for (int i = 0; i <= 30; ++i) {
        for (int j = 0; j <= 30; ++j) {
            for (int x = 1; x <= n; ++x) {
                f[0][0] = 1, f[0][1] = f[0][2] = f[0][3] = 0;
                int u = (((a[x] >> i) & 1) << 1) | ((a[x] >> j) & 1);
                for (int y = 0; y < 4; ++y) {
                    f[x][y] = ((1 - P) * f[x - 1][y] + P * f[x - 1][u ^ y]) % MOD;
                }
            }
            ans = (ans + ((f[n][3] * (1 << i)) % MOD) * (1 << j)) % MOD;
        }
    }
    ans = (ans + MOD) % MOD;
    printf("%lld", ans);
    return 0;
}