#include <stdio.h>

#define NUM_COLS 5

// Return the index of the first row where every element is strictly 
// greater than the element to its left.
// If no such row exists, return -1.
int first_sorted_row(int num_rows, int array[][NUM_COLS]) {
    // PUT YOUR CODE HERE (you must change the next line!)
    return 42;
}

// This is a simple main function which could be used
// to test your first_sorted_row function.
// It will not be marked.
// Only your first_sorted_row function will be marked.
int main(void) {
    int test_array[4][NUM_COLS] = {
        {16, 12, 8, 4, 1},  // Row 0: Decreasing
        {2, 4, 10, 15, 20}, // Row 1: Strictly Increasing!
        {3, 6, 12, 11, 20}, // Row 2: Not sorted (11 < 12)
        {5, 5, 5, 5, 5}     // Row 3: Not strictly increasing
    };

    int result = first_sorted_row(4, test_array);
    printf("%d\n", result);

    return 0;
}