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:
[[-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:
[[-4, 11], [12, -196, -120, 66, -157, -72]]
answer:
[11, 66]


question:
[[-125, -23, -9, -129, -86], [1, -118, -152, -155, -59, 57], [-92, 48, -192], [-176, 68, -28, -52, 44, -195, -101], [-157, -165, -95, -103, -191, -4, -104], [-172, 38, 79, -140, -158]]
answer:

[-9, 57, 48, 68, -4, 79]