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.
[[39, 76, 61, -184, -79, 60, -114], [100, 25, -135, -119, 8], [-69, 76, 75, 17, -48], [-6, 4, -142], [-54, 75, -144, 86, -4], [57, 97, -41, 7, -24, 22, -76], [98, -167, -145], [25, 21, -55, 95, -183]]