#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

bool* solution(int* candiesCount, int candiesSize, int** queries, int queriesSize, int* returnSize) {
    *returnSize = queriesSize;
    
    // Build prefix sums
    long long* prefixSum = (long long*)calloc(candiesSize + 1, sizeof(long long));
    for (int i = 0; i < candiesSize; i++) {
        prefixSum[i + 1] = prefixSum[i] + candiesCount[i];
    }
    
    bool* result = (bool*)malloc(queriesSize * sizeof(bool));
    for (int i = 0; i < queriesSize; i++) {
        int favoriteType = queries[i][0];
        long long favoriteDay = queries[i][1];
        long long dailyCap = queries[i][2];
        
        // Total candies before favorite type
        long long candiesBefore = prefixSum[favoriteType];
        
        // Minimum days to reach favorite type
        long long minDays = candiesBefore / dailyCap;
        
        // Maximum days to reach favorite type
        long long maxDays = candiesBefore + candiesCount[favoriteType] - 1;
        
        // Check if favorite day is within range
        result[i] = (minDays <= favoriteDay && favoriteDay <= maxDays);
    }
    
    free(prefixSum);
    return result;
}

int main() {
    // Parse input and call solution
    return 0;
}