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.
[[-119, -137], [48, -177, -197, -85, -27, 26], [-171, -26, 20, -189, -150, -64, -93], [32, 23, -136, -17, -49], [-179, 0, -94, 48, -101, -71, -82], [28, 70], [-33, -12, -75]]