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.
[[-68, -120, -164, -59, -49], [41, -125, 35, -142], [-131, -30, 0], [16, -128, 89, -194, 46, -113, 62], [-181, -104, 77], [-181, -68, 86], [76, -96, 64, -190, 71, 87, -171], [-192, -101, -21]]