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.

[[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]
[80, 88, 84, 99, 34]

[[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]
[99, -20, 93, 56, 24, 100]

[[69, -33, -167, -28], [79, 58, -119, 83, -40], [-133, -121, -141, -139, -135, 51, 22], [17, 54, -165, -94, 40], [-128, -45, 64, 42, 66]]

[69, 83, 51, 54, 66]