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, 52, -51, 11, 11, -10, -110], [-106, 81, -107, 100, -32, -155, -20], [42, -8, 66, 59, 87, 50, -107], [17, -32, -36, 62], [-103, -54, 79], [-197, -15], [9, -79, -89, -91], [-57, 14, 68]]