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.

[[-48, -41, 45, -29, -161], [-163, -76]]
[45, -76]

[[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]
[79, 24, 65, 25, 84]

[[-34, -136, 89, 78, 97, -199], [51, 55], [-61, -97, -197, -39], [-146, 27, -116, -192], [-55, -60, -70, -87], [76, -142, -170, -185, -112, 55], [55, 51, 37, 64, -76]]

[97, 55, -39, 27, -55, 76, 64]