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.
[[-102, -33, 21, 55, -15], [-53, -165, -199, 86, -160], [-39, -106, -160, -2, 69, 77, -178], [65, -13, -196, 8, -189, -27, 18], [93, -32, -166, 21]]