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.
[[84, -23, 41, 9, -69, -180, -68], [-90, -63], [-51, -24, -148, -10, 27], [44, -113, 66, -155, -80, -179, -173], [39, 78, 32], [25, 34], [79, 65, 17, 10, 11, -94, -69], [-1, -16, 14, -151, -176, -8, -27]]