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.

[[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]
[92, 29, -2]

[[-89, -60], [75, -56]]
[-60, 75]

[[-30, 51, 59, -171, -169, 89], [35, 74, -63, -99], [80, -125, -66, -112, -59, -164], [-193, -106, -178], [-12, -104, -96, -103, -57, -117], [-72, -94, 57, -112, -25], [-63, 41, 23], [-72, -57]]

[89, 74, 80, -106, -12, 57, 41, -57]