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]: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[A]: [75, 51, 10, 53, -43, 17, -111]


[Q]: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]
[A]: [85, -8, 67, 45, 71, 91]


[Q]: [[-193, 7, 64], [60, -64, -107, -198, -130], [77, -150, -63, -114, -84], [-16, -98, -174, -84, -154, -55, -176], [-55, -139, -80, -18, -198], [-97, -45]]
[A]:
[64, 60, 77, -16, -18, -45]