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.
[[31, -42, 32, -9, 22], [-161, 57, -45, -119, 88, -177], [-28, 100, 50, 98, -143, 12, -142], [-109, -99, -101], [-87, -84, -81, 57, -118, 4], [21, -94, -84], [-9, -99, 53, 94, 62, -171, -137], [-150, 70, -75, -19, 67], [55, 66, -52, 74, -113]]