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, -183, -124, -106, -133, -197, 33], [-120, 62, -152, 82, -110, -7], [0, -25, 41, 36, 59, -52, 85], [-77, -7, 84, -8], [-56, -192, -66, 74, 93], [-199, -156, 88, -11, -18, -39, 1]]