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.

[[-38, 56, -23], [-19, -178, -59]]
[56, -19]

[[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[10, 83, 86, 22]

[[-12, -19], [-129, -65, 16, -129, 41, 53], [-69, 42, 58], [85, -7, 36, -19], [-138, 68, 17, -119, -38, 6], [-12, 64, -57, -15], [-20, -100, -39, -107, -134, -177, -173]]

[-12, 53, 58, 85, 68, 64, -20]