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, -118, 4, 62, -154, -28, -122], [-81, -63, -97], [65, -33, 66, -47, -71], [-101, 79, -13, -194, 51, 10], [-142, -166, 39, 53, 36, -125, -164], [16, 54, -139, -9], [-128, 5], [-107, 39]]