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.
[[-66, -3, 60, -48, -53, -168, -59], [-27, -197, -45, -189, 46, -1], [-91, -146], [40, 3, 46, -8], [-102, 49, 25, -198, -176], [-158, -23, -66], [-146, -74]]