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.
[[-31, 72, -10], [-85, 5, -115, 3, 89], [21, -30, -23, -195, -140, 66], [19, -1, -67], [-20, -2, -47, -43], [-112, -71, 25, 82, -178, 1], [-20, 76, -67, -151, -145, -174], [-136, -133, 93, 89, -13, -52], [-193, -138, -193, -86, -37]]