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.
[[80, -119, 40, -162, -139], [-28, -167, 74, -65, -168, -64], [28, 92, -40], [-64, 69, -27, -22, -129], [-24, -154, -181, -105, -185, -147], [-118, -156], [70, -96, -124, -54, -84, -161, 22], [-102, -86, -89, -126]]