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.
[[-113, -141, -168], [-142, -157, -99, -95, -141, -161, -56], [74, -76, -95, -37], [-173, -132, -25, -124, 14, 90], [-4, -16], [-141, -56, -47, 34, -49], [-163, 96, -104]]