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.
[[-108, -119, 71, -83, -124], [-101, -116, -190, -182, -12], [31, -86, -3, 68, 73, -119], [-62, -26, -41, -128, -12, 93, 35], [-174, -70, -23, 39, -169, -133, 50]]