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.
[[31, -165], [-101, 40, -161, -62, -45, 59, -53], [-85, -79], [75, -159], [-168, -76], [-160, 32, -16, -61, 21, -79, -39], [-110, -4, -158], [1, 58, -146, -174]]