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.
[[30, -53, 43, 24, -75], [67, 12], [-41, -21, -10, -28, -151], [-146, -73, 14, -45, 41, -114], [-121, 77, -104, -42, 54, -21], [-138, -93, -97, -189], [34, -34, -95, -119, -130], [-2, -77]]