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.
[[53, -23, -128, 36], [-185, 98], [14, -141, 3, -44, -15, 80, -102], [-186, 65, -1, 65, -29, 64, 61], [63, -156], [-4, 83, -114, -88, -84, -140], [-182, -48, -125, -190, -12], [89, -41, -80, -64, -39]]