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.

[[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]
[9, 29, 22, 85, 77, 75]

[[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]
[16, 51, 99, 35]

[[-190, -192, -85, -33], [-130, -70, -116], [30, -175, -45, -124, -67, 90], [-101, -197], [-55, 60, 84, -30], [-179, 1], [-35, -43, -144, -123]]

[-33, -70, 90, -101, 84, 1, -35]