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.
[[-39, -92, -157, -117, -74], [-190, -188, 46], [-132, 12], [-70, 46, -147, -65, -165, 35, -39], [11, -10, -31], [-128, 75, 79, 47, -191], [-104, 83, -116, 98], [24, 36, -131, 47, 92, -191]]