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.
[[71, -21, -60, 90, -139], [-189, -131, -161], [-190, 48, 51, 12, -168, 40], [-166, -171, -155, 66, -8, -100]]