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]: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]
[A]: [19, -96, 60, 50, 63, 58, 92, 67]


[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]: [[-91, -174, -145, 0, -28, 3, 33], [-129, 72, 92, 49, 40, -121, 40], [13, -45, -26, -112], [-41, -175, -131, -114], [-59, -61, -107, 56, -80], [-32, -119, -159, -194, -165, -64], [-16, -25]]
[A]:
[33, 92, 13, -41, 56, -32, -16]