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.
[[73, -76, -84, -181, -36, -137, -165], [-15, -140, -160, 47, -65, -1, -136], [-114, -93, -56, 67], [-113, -128, -134, -192], [81, 58], [48, -42, 84], [-93, 80, -182, -37], [23, -95, -78, 73, 39]]