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.

[Q]: [[43, -158, 27, -169, -144, 35], [-73, -173]]
[A]: [43, -73]


[Q]: [[-67, 92, 59, -49, -22, -8], [-65, 28, -120, -118, -63, -19, -160], [10, 46, -37, 65, -184, 99, 52], [-18, 15, 6]]
[A]: [92, 28, 99, 15]


[Q]: [[-170, -2, -123, -140, 66, 4], [-193, -170, -113, 43], [3, -106, -56, -195, -14], [36, 14, -151], [12, 86, 59, -178, -66, -153]]
[A]:
[66, 43, 3, 36, 86]