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.
[[41, -65, 89, -140, -174, -194, 68], [-74, 39, -135, -5], [-115, 98, 81, -85, 80, 59], [-26, -198, -39, 49], [74, -176, -147, -65], [-136, -94], [-145, -142, 15, 95, -17], [-59, 7, -100], [88, -34]]