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.
[[33, -6], [10, 82, -73, -184, 40, -170, -91], [-175, 43, 96, -3, 4, -139, 57], [-67, -15, 88], [-171, -28, -134, -123, -108, 19, -87], [-109, 87, 89, 26, -19, -89, 41], [34, -98, -52, -170, -54, 54, 78]]