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]: [[52, -72], [-90, -59, -53, -180], [13, -64, -153], [-149, -38, 7, 61, 93, 1]]
[A]: [52, -53, 13, 93]


[Q]: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[A]: [53, 41, 80, 98, 91, 62]


[Q]: [[-192, -155, 4], [88, 57, -58, -84], [52, -159, 6, 100, 2, -157, -29], [-103, 2, -143, -178, 1, -114, -41], [-78, -119, -51, -144], [-183, 59, -198, -196, -192, 82, -66], [94, 55, -71, -156, -82, 90]]
[A]:
[4, 88, 100, 2, -51, 82, 94]