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.
[[60, -164], [-151, 17, -40, -63], [-17, -105, -1], [-87, 36, -81], [-150, 49, -155, 21, -25], [-49, -48, 29, -81, -166], [-93, -195, -200, -95, -194], [-88, -62, 54, 100, -133, 21, 63], [65, -63, -192]]