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.
[[30, 61, 65, -103, -107, 91], [92, 65, -192, 48], [-44, -138, -187, -151, 62, -162, 58], [-107, -156, -49, -191], [-185, -171], [-184, -38, -84, 22, -30, -177, -92], [-114, 5, -119, -180, -16, -17], [28, -5, -85, 85, -124]]