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.
[[-170, 59, -185, 48, -2], [28, -146, 46, -149, -2, -139], [-199, -109, -140, -197, -122, -61], [23, -189, 0, -57], [100, 70, -115, -37, -66, -184], [-14, 29, -190, -135, 95], [98, -11], [-157, -97, 25, 59, 22, 36], [-10, 70, -110]]