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.
[[-144, -41, 39, -51, -96], [-177, -94, -162], [89, -173], [-12, -162, -127, -148, 56, -96], [-111, -180, 58], [85, -127, -185, 98, -125], [-190, 18], [-128, -12], [38, 50, 76, -10, -105, -57]]