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: [[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: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

A: [41, -44, 34, 86, 26]
****
Q: [[79, -70, -12, -81, -33, 0], [-84, 10, -95, 88, -3, -144], [-29, -197, -58, 19, -134, -58], [-47, 73, -154, 41, -39], [-29, -180, -20], [91, 11]]

A:
[79, 88, 19, 73, -20, 91]
****