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

int compareStrings(const void* a, const void* b) {
    return strcmp(*(const char**)a, *(const char**)b);
}

char*** suggestedProducts(char** products, int productsSize, char* searchWord, int* returnSize, int** returnColumnSizes) {
    // Sort products
    qsort(products, productsSize, sizeof(char*), compareStrings);
    
    int searchLen = strlen(searchWord);
    *returnSize = searchLen;
    
    char*** result = (char***)malloc(searchLen * sizeof(char**));
    *returnColumnSizes = (int*)malloc(searchLen * sizeof(int));
    
    for (int i = 0; i < searchLen; i++) {
        char prefix[1001];
        strncpy(prefix, searchWord, i + 1);
        prefix[i + 1] = '\0';
        
        // Find range using binary search approach
        int left = 0, right = productsSize;
        
        // Simplified: find matches and take first 3
        char** matches = (char**)malloc(3 * sizeof(char*));
        int matchCount = 0;
        
        for (int j = 0; j < productsSize && matchCount < 3; j++) {
            if (strncmp(products[j], prefix, i + 1) == 0) {
                matches[matchCount++] = products[j];
            }
        }
        
        (*returnColumnSizes)[i] = matchCount;
        result[i] = matches;
    }
    
    return result;
}