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]: [[69, -92, -181, 13, 31, -185], [-14, -145, -116, 13, -132, 90, 0], [-188, -25, -182, -101, 14]]
[EX A]: [69, 90, 14]

[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]: [[5, -45], [43, 34, -178], [-14, -141, -121, -20], [96, 1, -66, -171], [32, 67]]
[EX A]:
[5, 43, -14, 96, 67]