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:
[[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]
answer:
[8, -11, -47, 24, 61, -67, -11, 70, 10]


question:
[[40, -40, -148, -172], [-116, -46, 92, -51, -20], [-161, -93, 46, -56], [3, -153, 79, -38, 62, -57]]
answer:
[40, 92, 46, 79]


question:
[[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]
answer:

[97, 25, 45, 51, -113, -56, 41, -40, 74]