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.
[[-185, -146, -74, 16, 30, 37], [-11, -160, 48], [-87, -75, -86, -170], [10, -102, 31, -13, -81], [-95, -134, 8, -98, -155, 18, -142], [-184, -11], [-122, 80, -186, 19, -196, -109]]