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.
[[38, 75, -169, -170, -44, -185, 48], [-31, -22, -184, -117, -14, -29, 6], [30, 2, -145, 50, 91], [-5, -199, 48, 69, 58, -51]]