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.
[[-145, 28, -115, 29, -29, -62, 91], [88, -93], [-71, -13, -68, -154], [-70, 30, 45, -180, 38, -75], [84, -142, 49], [-78, -148, 75, -190, -153, -105], [-28, -66, -101], [-37, 48, -127, -35, 27, -107, -164]]