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]: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[A]: [93, -40, -72, 13, 91, 35, 33, 28]


[Q]: [[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]
[A]: [89, -13, 20, 92, 100, 13, 6, 88, 71]


[Q]: [[49, -44, 33, -114, 42, -16], [50, -153, -180, -60, -86], [44, 89, 46, -74, -160, -152]]
[A]:
[49, 50, 89]