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.
[[-179, 73, -55, -43], [-195, -182, -146, -198, -1], [-182, -173, 62, 1, 12], [-84, 70, -111, -102], [30, 60, -121, 70, -111, 60], [-149, 32, -142], [-150, 33, -55, -173, -117], [-22, 40, 84, -59, -39]]