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.
[[-200, 67], [100, -189, 2, -76, -44, -120], [61, -38, -71], [-105, 50, -71, -145, -107, 43, -1], [-173, -90, 1, -146, -15], [95, -4, 38], [-27, -157, -141, 12, -171, -42], [22, 20, -170, -57], [-148, -178, -12, 92]]