In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

[EX Q]: [[-106, -87, -48, -151, -158], [37, -16, -44, -111, -9, 24], [77, -42, 54, -105, -26, 78, 55], [-60, -1, -86, 94, -187, -90], [-163, -119], [79, -109, -183, -28], [23, 3, 43], [49, -109, -5, -47, -196], [7, -35, 95, -85, 99, -86, -22]]
[EX A]: [-48, 37, 78, 94, -119, 79, 43, 49, 99]

[EX Q]: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]
[EX A]: [91, -49, 89, 83, 92, -91]

[EX Q]: [[-59, 49], [27, 51, -27], [-173, -192], [-117, -126, 1, 52, -198, 45, -30], [24, 64, 76]]
[EX A]:
[49, 51, -173, 52, 76]