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.
[[-19, -24, 45, -24, 51], [52, -115, -21, -95, 77, -199], [39, 66, -19, 80, -161, 40, -80], [-45, -171, 66, 42, -46], [-136, -87, -136, -66]]