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.

[[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]
[65, 45, 9]

[[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
[65, 67, 98, 47, 76, -16, 91, 64]

[[-158, -42, -150, -84], [0, -57, -54, 92, -39, -52], [-115, -83, -149]]

[-42, 92, -83]