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.
[[-186, 46, -192, -83, -74, -139, -50], [-123, -54, -10, 2, 8, -80, -53], [-182, -146, 43, -128], [84, 17, 57, -198, -108, -33, 26], [9, -28, -21, -114, 33, -191, 20], [-28, 54], [-117, -194, 64, -3, 36, -89], [-78, 45, -70, 12], [-134, -120, 27, -12, -48, 97, 99]]