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.
[[-39, -105, -79, 84, -91, -17], [-68, -89], [-94, -155, 73, -42, 83, -122, -53], [12, -70, 93, 71, 95], [-154, -61, -176, -195, 0, -105], [2, -98, 75, 32, -156, -166], [84, -57, 74, 72, 8, 48, -5], [1, -156, -164, 47, -52, -15, -131], [-145, -139, -54]]