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.
[[33, -16, 34, -135], [65, -41, 53, -111, 50], [58, -55], [-90, -6, -61, -92, -114, 95, 5], [-150, -199], [-37, 21]]