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:
[[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]
answer:
[14, -43, -3, 14, 56, 61, -19, 97, -14]


question:
[[-191, 15, 11, -122, -8, -77, 51], [82, 28]]
answer:
[51, 82]


question:
[[-78, -59, -124, -147], [-176, -143, -136, 0, 33], [-15, 86, -179, -101, -45, -168, 75], [-159, 26, 52, 88, 76, 94, 89], [-166, -22, -63, -118, -77, -192], [30, 36, -62, -114], [-150, -125, -66, 79, -154]]
answer:

[-59, 33, 86, 94, -22, 36, 79]