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.
[[-155, -136, -35, -99, -73], [39, -142, -69, -64, -2, 43, -127], [-191, -12, -192], [-109, -120, 99, -2, -115, -137, -82], [-93, -67], [-112, -109, 57, 62, 66, -102, 95], [-154, -9, -30, -60, -137, -188]]