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]: [[-143, 33, -146], [-82, -145, -105, -21], [0, -95, -164], [-153, 9, 51, 84, 71, -82], [5, 73, 67, -153, 11, -136], [-1, 81, -75, -41], [-102, -43, 69, -150]]
[EX A]: [33, -21, 0, 84, 73, 81, 69]

[EX Q]: [[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]
[EX A]: [49, -27, -132, 98, 73, 74]

[EX Q]: [[16, -55, -13, -20, -31], [91, -86, 13]]
[EX A]:
[16, 91]