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.
[[-193, -20, 60, -116, -78, -73, -71], [-106, -16, 27, -53, 93], [-13, -35, 23], [-32, -68, -48, -52, 13, 87], [-107, -166, -5, 42, -146, -36, -175], [-165, 49, -76, 24, -108], [54, 12]]