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.
2, 9, ['w', '1145', '7745', 'r', '6715', 'p', 'o', 'G', '7061', 'i', 't', 'b', '741', 'Y', 'f', 'Z', '9619', 'e', '9425', 'M', '775', 'j']