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.
[[-155, -94, 89, -84, -2], [93, -40, -41], [-21, -123], [-67, -85, -67, -21, -123, -88], [35, 34, 33, -54, -166], [-131, 62, -94, -131, 63, -26, -66], [37, 25, -162], [93, 89, -112, -46, -129, -25]]