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.

[[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]
[57, 61, 36, 78]

[[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]
[67, 26, 66, 99]

[[-35, 7, -22, -22, 98, -152], [-101, -17, -115, 37, -2, 44], [-45, 47, -2, 10, -89, 20, -142], [54, 4, -105, -140, 90, -46]]

[98, 44, 47, 90]