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, -148, -34, 20, -133, -29, 19], [59, -109, 85, 21], [-183, -110, -14, -61, 17, 3], [-119, 24, -32, -146, -83], [76, -171, 98, -1, 1], [-15, -30, -118, 95], [19, -180], [-58, 85]]