Given an array of integers `arr` and a set of `queries` of the form `[left, right, k]`, your task is to find the number of occurrences of the number `k` in the inclusive subarray `arr[left...right]` (0-based), for each query. Return the sum of the answers for all queries as the result.\n\n**Example:**\n```\nInput: arr = [1, 2, 1, 3, 1, 2, 1], queries = [[1, 3, 3], [0, 4, 1], [2, 5, 2], [5, 6, 1]]\nOutput: 6\n```\n\nWhat was the most efficient solution for this one?

Given an array of integers arr and a set of queries of the form [left, right, k], your task is to find the number of occurrences of the number k in the inclusiv