In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
8, 17, ['7955', 'l', '1371', '7597', '2715', 'f', '9227', 'W', '9481', 'T', '7957', '9967', 'S', 'a', 'l', 'T', '6547', 'h', 'e', 'v', 'o', '1193', '5731']