#include <iostream>
#include <vector>

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1e9 + 7;
using mint = ModInt<MOD>;

using lint = long long;

constexpr int X = 100000;

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<mint> vdp(X + 1, 0);
    vdp[0] = 1;
    while (n--) {
        int v;
        std::cin >> v;
        for (int x = X; x >= v; --x) {
            vdp[x] += vdp[x - v];
        }
    }

    std::vector<mint> rdp(X + 1, 0);
    rdp[0] = 1;
    while (m--) {
        int r;
        std::cin >> r;
        for (int x = X; x >= r; --x) {
            rdp[x] += rdp[x - r];
        }
    }

    for (int x = 1; x <= X; ++x) vdp[x] += vdp[x - 1];

    lint a, b;
    std::cin >> a >> b;

    mint ans = 0;
    for (int r = 0; r <= X; ++r) {
        lint low = a * r, high = b * r;
        high = std::min(high, lint(X));
        if (low > high) continue;
        ans += (vdp[high] - (low == 0 ? 0 : vdp[low - 1])) * rdp[r];
    }

    std::cout << ans - 1 << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}