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.
[[13, -68, -197, 25], [-81, 46, 59], [-41, -49, -110, -10, -44], [37, 54, -71, -133, 5], [54, 99, -174, -103], [-52, -103], [-73, -181, 58, -80, -141, -1], [-39, -145, -96, 47], [-33, -83, -92, 76, -30, -130, -66]]