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.
[[16, 80, 2, -184, -130, -165], [-112, -61, -27, -67, 15, -85], [-151, 71, -125, -164], [-98, -85, -37, -182, 21, -135, 13], [1, -98, -24, -171], [-76, -172, -152, -116, 2, 74, -118], [33, 25], [-92, -30, 18, 6, -55, 10, -191]]