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.
[[51, 69, 16, -10, -129, -67], [-103, -143, -154, -20, -98, -18, -185], [-10, -134, 18, 0, -167, -168, 42], [-129, -8, -71], [10, 25, -159, -150, -71], [100, 69, -89, -138, -160, -199, 18], [21, 90, 46, -78, -146]]