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.
[[76, -72, -162, -43, -175], [12, -16, 3, 35, -80, -52, 91], [45, -130], [49, -184, 83, -99], [-195, -119, -17, -39, -111, 77], [49, 40, -169], [-193, -107, 74, -174, -178, -125, -60], [-62, -59, -149, -72]]