instruction:
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.
question:
[[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
answer:
[47, 58, 99, -57, 92, -77, 30, 0, -38]


question:
[[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]
answer:
[-19, -112, 30, 59, 65, -7, -16, 86, 39]


question:
[[-118, -198, -191, -122, 38, -32], [-46, 90, -146, -176, -163, -128, -163], [34, -162, 65], [-21, -155, -149, -112], [-186, -17, 45, 80, -68, 36]]
answer:

[38, 90, 65, -21, 80]