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.
[[-17, 64, -95, -39, -97, -42, -180], [82, -142, -71, -16, 92, -54], [49, -100, 35], [71, -130, 19, 38, -66], [-47, 86, -79, 75, -100, -3, 94], [-120, -101, 8, -89, -184, -85, 87], [-111, 39, -173, -114, -111, -188, 92], [-107, -112, 67, 6]]