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.
[[81, -147, -71, 28], [87, -186, -59, -195, 58], [-188, 54], [-198, -59, -35, -113, 76, -19, -158], [-11, -142, -168, -118, -145, -105, -198], [-57, -119, 90, 59]]