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.
[[48, -168, 84, -81, 54], [71, 41, -173], [28, -4, -100, -90, -97, 43, -184], [17, 21, -111, 57, -104, -75, 72], [76, -16, 11, 53, 38, 10, -175], [-179, 90, -20], [5, 21, -174, -89, -58, 80], [46, 41, 38], [-99, -130, -162]]