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.
[[51, -77, 69, -165, -145, -39, -99], [-93, 35, -140, -131, 9], [49, -139, -173, -16], [-81, -186, 83, -190], [-26, -151, -161, -28, 7, -194], [-175, -31, 63, -98, -23], [-98, -176, 32], [-110, 12, -115], [-168, 15, -25, 49, -124, -11]]