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.
[[-75, -71, -137, 66, -183, -37, -200], [-10, -116, -39, -150, 81, -196, -38], [-181, -143], [-122, -25, -11, -180, -48], [29, -53, -164, -66]]