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.
[[20, -53, -189], [71, -68, 65, -45, -73, 59], [7, -140, -120, -135, -162], [-122, -183, 13, -105], [35, 6, -13, -37, -10, -81], [-166, -48, -123, -60, 62], [-83, 11], [-172, -144, 99, 67, -138], [65, 52, -143]]