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.
[[-140, -72, -116, -198, -22, -6, -118], [-28, 38, 9, 74], [66, -100, -166, -164, -155], [-30, -59, -195, -116, -26], [91, -109, -192, -151, 25, -194, 53], [33, 57, -176, -124, -30, -64, -171], [-79, 66, -98], [-173, -138, 60], [79, -10, -83]]