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]: [[56, -4, -191, -182], [47, -70, -154], [-16, -195, -67, -196, -12]]
[A]: [56, 47, -12]


[Q]: [[-45, 39, 37, 4], [68, -44, 26, 94], [-98, -15, -9, -140], [-73, 23, -72], [20, 53, -23, -25, -81], [92, -5, 57], [72, 39, -80], [-75, -120, 15], [13, 38, -63, -164]]
[A]: [39, 94, -9, 23, 53, 92, 72, 15, 38]


[Q]: [[-163, 17, -2, -63, -4, -113], [-196, 31, 22, 50, -18, -192], [-140, -89, 81, -136], [-141, -57], [18, 20, 34, -188], [-140, 95], [-132, -180], [58, -18, 39]]
[A]:
[17, 50, 81, -57, 34, 95, -132, 58]