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, 17, 80, -170, -83, -131], [-89, -175, -54, -182], [-96, -104, 15, -186, -174], [75, -4, -171, -97, -145, 60], [-120, 48, -120, -6, -114, -90, -27], [-60, 24, 19, -2]]