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]: [[-134, -121, 72, 82, -12, -28], [67, 87, 98, -58, -57, 6, 84], [-46, 76, -179, 21, -132, -46], [12, -67, -19, -46], [-62, -22, 58, -139, -39, -118], [-5, -170, 85, -75, -126, 53, -63], [9, -82, 7], [-88, -111, -81, 86, -17, 36, -160]]
[A]: [82, 98, 76, 12, 58, 85, 9, 86]


[Q]: [[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]
[A]: [14, -43, -3, 14, 56, 61, -19, 97, -14]


[Q]: [[-200, -55, -94, 83, -144, -15], [83, -73, -2]]
[A]:
[83, 83]