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.
[[-1, -115, -16, -85, -114, 35], [-69, -40, 85, 72], [79, 15], [15, -126, -137, -200, 3, -32, -103], [-83, -185, -22, -74, -38, -45], [-89, -189], [15, -148, 19], [-135, -99, -148, -143, -6, 67, -117], [-131, -187, 50, -135, -57, -128]]