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.
[[50, -8, -128, 11], [-176, 77, -27, -2, 19], [86, -113, -122], [-57, 9, -139, -105], [-166, -184, -121, 92], [-45, -80, 68], [26, -61, 95, -140, -150, 31, -12]]