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.
[[-171, 36, -61, 69, -9, -146], [-110, 46, 99, -120, 97], [-12, 37, -8, 70], [-150, 77, -108], [-160, -149], [-143, -92, 4, 83, 100, -110, -62], [-68, 8, -105, -195], [-153, 93, 82, 38, -69, -165, -109], [-166, -28, -81, -134]]