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.
[[1, 42], [19, 56, -142], [-159, -135], [-170, 37], [8, 20, 62, -181, -58, -171], [-81, -48], [-53, -24, -181, -109, -184, -196], [-172, -185, 25]]