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.
[[-112, 66, -4, -26, -15, -171], [12, 7, 70, 33, -130, -53], [-142, -174, -126, -165, -45], [16, -99, -148, -96, -22, -54], [53, -161, -168], [-108, 80, -37, -45], [41, 12]]