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.
[[-175, 29, -110, 39], [-166, 42], [90, 44, -42, -76, -75, -29], [-186, -161, -42, 6], [63, 73, -146, 27], [-106, -40, -91, -141], [-39, -41, -119], [4, 50, -113], [-84, -18]]