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.

[[-6, 41, -190], [-47, 89], [29, -17, -135]]
[41, 89, 29]

[[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]
[54, 44, 50, 12, 24, -28]

[[-70, -116, -141, 89], [-23, -103, 85, -169], [97, -67, -141], [-45, -71, -145, -159, 68], [-13, -135, -111, -125], [2, -8], [-147, -98, 55, -70], [54, -20], [-21, 22]]

[89, 85, 97, 68, -13, 2, 55, 54, 22]