import heapq
from functools import reduce


def product_of_k_largest(numbers, k):
    # Use a min-heap to store the k largest elements
    min_heap = []

    for num in numbers:
        # Push the current number onto the heap
        heapq.heappush(min_heap, num)

        # If the heap grows beyond size k, remove the smallest element
        if len(min_heap) > k:
            heapq.heappop(min_heap)

    # Compute the product of the k largest elements
    return reduce(lambda x, y: x * y, min_heap, 1)


def main():
    MOD = 10**9 + 7
    N, Q = map(int, input().split())
    nums = list(map(int, input().split()))
    for _ in range(Q):
        L, R, k = map(int, input().split())
        sub = nums[L : R + 1]
        mul = product_of_k_largest(sub, k)  # prod(sorted(sub, reverse=True)[:k])
        print(mul % MOD)


main()