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.
[[62, -169, 55, 89, 87], [-27, -33, -41, 3], [84, 43, -122, -112, 16, -50], [38, -111, -200, -103, -168, -186], [2, -85], [90, -67, 31, -188, -172, 100], [17, -89, -196, 34], [26, -190, -71], [-123, -63, -161, -167, 0, -146]]