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.

[[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]
[20, -71, 9, 97, 46, 17, 90]

[[-200, -55, -94, 83, -144, -15], [83, -73, -2]]
[83, 83]

[[83, 97, -188, -8, -31, 68, 83], [52, -153, -181, 94], [-112, 93, 100, 20, -155], [93, -21, 91, -167, -104, 8]]

[97, 94, 100, 93]