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: [[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]

A: [12, 69, -30, -7]
****
Q: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

A: [11, 41, 90, 72, 34, 56, 91, -133]
****
Q: [[77, 2, 66, -85, -144], [-148, 10, -44], [-107, -113, -27, -26, 38, -151, -124], [13, -188, -54], [-97, 65], [-182, -100, -119, -1], [54, -124, -78, -76, -135, 56]]

A:
[77, 10, 38, 13, 65, -1, 56]
****