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.
[[-179, -23, 4, -20, 36, -38, -152], [-148, -187], [45, -20, -111, -24, -41, -133, -149], [-133, 26, -28, -46, -141, -4], [-104, -171, -189, -105, 93], [56, -134, -116], [1, -7, -123]]