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.
[[-186, 56, 51, 79, -33, 73], [-7, 2], [41, 11, 48, 16, -186, -166, 3], [6, -195, -109, -68], [-28, 19, -69, -81, -25, 92, -74], [52, 15, -188, -147, 7]]