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.

Ex Input:
[[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]

Ex Output:
[61, 28, 95, 9]


Ex Input:
[[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]

Ex Output:
[91, 53, 82, -9]


Ex Input:
[[-199, -53, -33, 0, -146], [-65, -32, 71, 28, -200], [58, -166, 72, -145, -49, 34, -58], [-193, 98, 64, 10, 56, -146, -33], [8, -81, -65], [-48, -180, -144, -102, -98], [-192, -137, -30, 27]]

Ex Output:

[0, 71, 72, 98, 8, -48, 27]