import numpy as np

def solve(stdin):
  N, Q = stdin[:2]
  A = stdin[2: 2 + N]
  dp = np.full((N + 1, 5001), -1)
  dp[0][0] = 0
  for i in range(N):
    for j in range(5001):
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
      if j + A[i] <= 5000:
        dp[i + 1][j + A[i]] = max(dp[i + 1][j + A[i]], dp[i][j])
    dp[i + 1][0] = i + 1

  for i in range(Q):
    l, r, k = stdin[2 + N + 3 * i: 2 + N + 3 * (i + 1)]
    if dp[r][k] >= l - 1:
      print("Yes")
    else:
      print("No")

solve(np.fromstring(open(0).read(), dtype=np.int64, sep=' '))