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.
[[53, 74, -153, -71, -194, -70, -39], [73, 44, -188, 21, 24, 7], [29, -172, -26, 86, -105, -123], [42, -9, -127, -25, -93, 15], [-59, 2, 30, -78, -56], [-20, 89, -48, -163], [-185, -177, 86]]