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.
[[37, -1, 85, 95, 43, -90, -166], [51, -152, -176, -82, -192, 39, 6], [-173, -91], [-199, -93, -5, -184, -99], [-185, -134, -145], [-64, -11, -93, -179, 48, -156], [-21, -98, 49, -20, -154, 82]]