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.
[[60, 9, 51, -109], [59, -118, -53, 82, -66, 25, 44], [-86, -66, -11, -108, -40, -73], [-143, -36, -113, 35, 78], [-88, -189, 54, -2], [15, -50], [-78, -162, -14, -138, -105, -37], [-10, -190, 96, -63], [35, 17, -2, -150, 35, -49]]