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.
[[57, 22, 42, -130, -153, -36, -113], [-186, -104, -119, 32], [93, 0, -20, -180, -168, -37, -181], [6, 36, -26], [-171, -57, -49, -7], [-111, -76, -121, -73, 88, -166], [-118, 69, -73, 40], [-14, -116, -151, -80, -83, -59]]