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.
[[-3, -185, 34, -61, 49, 89], [-116, -150, -74, -153, 10, -126], [-169, 52, -89, -181, 69], [56, 69, 82], [79, -119, 87, -43], [-108, -72, -157], [-188, -49, 96, -146, -200, -170], [-90, -30, -195], [81, 48, 34, -104]]