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]

[[78, 3, -186, -60, -85, -7], [-3, -75, -30], [63, -19, -166], [-47, -88, 58], [-94, -36, -79], [-134, -2, 43, 87]]
[78, -3, 63, 58, -36, 87]

[[50, -15, 86], [70, 15, -89, 17, 60], [-98, -15, 35, -140, 42, -167], [66, 31, 27], [-163, -21, -78, -123, 10, -112]]

[86, 70, 42, 66, 10]