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.

[[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]
[41, -44, 34, 86, 26]

[[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]
[71, 44, 78, 87, 68, 91]

[[-38, 16], [-26, -153, -70, 31, 39, 91, -183], [-61, -127, -167, -20, -29, -172], [34, -10, 73, -193, 48, -187], [-165, 55], [-71, -92, 40, 37, -128, 96, 54], [-155, -182]]

[16, 91, -20, 73, 55, 96, -155]