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:
[[-105, -7, 11, -135], [-148, -166, 11], [-160, -67, 35], [38, -54, -108, 82, 46, -10], [-82, -177, -194, -95, -75, -86, 48], [-52, -21, 47, 41, -120, 95], [-181, -142, 2, -18, -34], [0, -148], [-115, -151]]
answer:
[11, 11, 35, 82, 48, 95, 2, 0, -115]


question:
[[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]
answer:
[-41, 13, 43, 88, 15, 32, 33, 57]


question:
[[-191, -1, 4, -70], [62, 87, -46, -108], [-176, 77], [-71, -5, -17, -14, 32, -72], [-103, 36, 28, -176], [-133, 6, -97, -118, 5, -3], [85, 6, 26, 75], [-10, -62, 7, -193, -183, -42]]
answer:

[4, 87, 77, 32, 36, 6, 85, 7]