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.
[[-171, -129, 53, -139, 65, 100, -86], [-89, -68, -158, 66, -151, -165, -61], [-124, -112, -98, 91, -141], [-64, 53, 94, -111, 52, 68, -54], [-21, 27, -106, -104], [-118, -43, 69], [-145, -45], [28, -169, -133], [-180, -74, -40, 2, 33, 68]]