#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <cstdio>
#include <vector>
#include <bitset>

constexpr unsigned B = 10;

int main() {
    unsigned N, Q;
    std::scanf("%u %u", &N, &Q);
    std::vector<unsigned> A(N);
    for (auto &x: A) {
        std::scanf("%u", &x);
    }
    const unsigned Size = N / B;
    std::vector<std::vector<std::bitset<5001>>> memo(Size, std::vector<std::bitset<5001>>(Size));
    for (unsigned i = 0; i < Size; ++i) {
        memo[i][i].set(0);
        for (unsigned j = i + 1; j < Size; ++j) {
            memo[i][j] |= memo[i][j - 1];
            for (unsigned k = B * (j - 1); k < B * j; ++k) {
                memo[i][j] |= memo[i][j] << A[k];
            }
        }
    }
    while (Q--) {
        unsigned l, r, k;
        std::scanf("%u %u %u", &l, &r, &k);
        l -= 1;
        if (r - l <= B * 2) {
            std::bitset<5001> dp;
            dp.set(0);
            for (unsigned i = l; i < r; ++i) {
                dp |= dp << A[i];
            }
            if (dp.test(k)) {
                std::puts("Yes");
            }
            else {
                std::puts("No");
            }
        }
        else {
            r -= 1;
            const unsigned lk = (l + B - 1) / B;
            const unsigned rk = r / B;
            auto dp = memo[lk][rk];
            for (unsigned k = l; k < B * lk; ++k) {
                dp |= dp << A[k];
            }
            for (unsigned k = B * rk; k <= r; ++k) {
                dp |= dp << A[k];
            }
            if (dp.test(k)) {
                std::puts("Yes");
            }
            else {
                std::puts("No");
            }
        }
    }
}