from math import prod
from collections import defaultdict


def main():
    MOD = 10**9 + 7
    N, Q = map(int, input().split())
    nums = list(map(int, input().split()))

    # Memoization caches
    sorted_cache = defaultdict(list)  # Cache for sorted subarrays
    product_cache = {}  # Cache for product of top k elements

    # Function to compute the product of top k elements
    def get_top_k_product(L, R, k):
        # If we already have the result in the cache, return it
        if (L, R, k) in product_cache:
            return product_cache[(L, R, k)]

        # Otherwise, compute it from scratch
        sub = nums[L : R + 1]
        if (L, R) not in sorted_cache:
            sorted_cache[(L, R)] = sorted(
                sub, reverse=True
            )  # Sort only once for each range
        top_k = sorted_cache[(L, R)][:k]

        # Calculate the product of the top k elements
        result = prod(top_k) % MOD
        product_cache[(L, R, k)] = result  # Cache the result

        return result

    # Process queries
    for _ in range(Q):
        L, R, k = map(int, input().split())
        print(get_top_k_product(L, R, k))


main()