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.

[[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
[66, 16, 16, 69, 12, 80]

[[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]
[95, -43, 91, 90]

[[-172, 63, -139], [93, -155, -167], [-115, 89, 95, -32], [-146, 48, -31, -1, 51], [50, -129, -185], [-189, 35, -66, -57], [-126, -63, -85, -16, -47], [-10, -84, -59, 26, 35, -146]]

[63, 93, 95, 51, 50, 35, -16, 35]