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.

[[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]
[65, 53, 72, -30, 85, 38]

[[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]
[77, 81, 85, 93, 54, 88]

[[-15, -146, 65, 1, 46, -59], [53, 68], [-118, -116], [-90, -60, -145, 73, -118, -171], [-21, -51, -104, -168, 30, -130], [8, -54, -25, 73, 76, -123, -55], [-55, -111, 29, -109, -165, 28]]

[65, 68, -116, 73, 30, 76, 29]