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.
[[-158, -8, 24, -130, -41, -106, 64], [-187, -105, -76], [-169, -65, -181, 33, -165], [-103, -110, 16, -151, -48, -147, -165], [-109, 23, -52, -146, -101], [-140, 0], [-112, -194, -109, -89]]