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.
[[-12, -187, -33, 22], [-65, -197, 84, -84], [59, 6], [-103, -195], [-190, -129, -98, -106, 98, -59], [-164, -82, -93, 65, -123], [-119, 19, 15, -118], [-113, 6, -149, -138, -198, -3], [-124, -146, 93, -15, -102, 36]]