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.
[[-5, -168, -161, -174, -10, -199, -38], [19, -7, -93, -86], [-194, -155, 21], [-57, 6, -59, -37, 86, -140, -127], [-169, 14, -167, -199], [-30, -105, -51, 71, -44, -162, 29], [-27, -5], [-76, -129, -33, -120, -43, 23]]