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.
[[45, 73, -80, -38], [-150, -41, -120, 51, 48, -184], [-61, -6, 51, -30, 69, 15], [73, -142, -25, 20, -115], [-77, -140], [-151, 48, -171, -61, -136, 59, 31], [-197, -15, -26, -18, -122, -140], [42, 77, -71, -180, 99, -121, -39]]