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.
[[23, -2], [-65, -120, 21], [-59, -109], [3, -181], [48, -175, -190, -186, -72], [-10, -55, -106, -103, -148]]