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.

[[-120, -84], [10, 74, -15, -153]]
[-84, 74]

[[57, 1, -116, -74, 72, -86], [-19, -44, -181, 89, -174, 39, 96], [-170, -82, -59, 83]]
[72, 96, 83]

[[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

[38, 25, -7, 1, 40, 92, 87, 76, -95]