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.
[[-190, 1, -31], [20, -5, -50, 60], [34, -4, -10, -106], [-43, -43, 16, -180], [-114, 16, 81, -197, -184, -7, -159], [-165, -20, 39, -197, -108, -115], [74, -34, 99], [90, -93, 66], [-170, -112, -149, -126, -53, -83]]