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.
[[-18, -111, 15, -90, 17, -194, 40], [-24, 94, 26, 36, -71], [56, -7, -111, -50, 30, -62], [-25, -50, -198, 91, -119], [-32, -137, -20, -138, -174, -149, 66]]