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.

[[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]
[29, 63, 12, 34]

[[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]
[-7, 71, 29, 59, 93, 71]

[[-50, -142, -179, -83, -158], [57, -19, 28, -82], [-200, 52, -57, -42, -65, -155], [-142, -127, 98, -175, -7]]

[-50, 57, 52, 98]