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.

[[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]

[[-14, -21, 36, -53, -155, -43], [-83, 77, 97, -108, -117, 62, 5], [83, -147, -157, -169, -41], [-10, 92, -27], [-180, 1, -47], [-104, 1, -149]]
[36, 97, 83, 92, 1, 1]

[[-76, -180, -140], [-7, -142, 1, 69, -7], [62, -66, 63, -14, 1], [-134, 61, -172], [-82, -175, 58, -182, -123, -140], [-152, -150, 28, 60, 71, -98, -150]]

[-76, 69, 63, 61, 58, 71]