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.
[[96, -156, 17, -174, -105, -45, -75], [42, -75, -165, -12, -127], [-6, 89, -200, 65, -61, 49, -67], [-158, 46, -190, -45, 72, 61, -107], [-187, -184, 75, -164, -158, 44, -73], [-108, 79, -114], [-7, -136], [-136, -142, -138, -128, -148]]