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.

[[64, -108], [42, 76, -28, -11, 28], [-37, -188, -155, 73, -137, 29], [-159, 66, 72, 95, -81], [-176, 24], [89, -106, 36, -126, -155], [-194, 39, -96, -11]]
[64, 76, 73, 95, 24, 89, 39]

[[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]
[63, 2, 29, 18, 98]

[[-193, 22, 73, -165, -19, -40, -165], [-164, -109, -131, 3, -54, -37], [-44, -37, -103, 10, -80, 67], [-184, 34, -136, -69], [3, -69], [6, -19, -135], [-51, -64, -148, 23]]

[73, 3, 67, 34, 3, 6, 23]