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.
[[-151, 78, -120], [-37, -123, 69, -84, -158], [-185, -22], [-122, 4, -33, -200, -10, 6, -120], [-73, -83, -46, -47, -37, -76], [-69, 98], [-197, 38, -17, -162, -71], [-165, 10], [-125, 55, -115, -20, -76, 86]]