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.
[[90, 93, -14], [20, -193, -154], [-150, -136, -1, 14, 29, -119], [-91, -127, -78, 56, -147, -189], [34, -167], [-172, -29, 20, 20, -119, 48], [-56, -153, -174, 97, -153], [-197, -60, 4, -135, -51, -169], [-146, -92, -137]]