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]: [[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]
[EX A]: [-29, 69, 1, 54, 52]

[EX Q]: [[-191, -80], [-39, -70, -54, 60, -191, 23, -200], [68, -61], [-60, 11, -170, -187], [98, 89, 92, 60, 31, -2]]
[EX A]:
[-80, 60, 68, 11, 98]