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.

Example Input: 1, 12, ['m', 'f', 'y', '2363', '9555', 'E', 'm', 'J', '1977', 'z', '3733', '9745', 'm', 'u', '1033', 'x', '7351', 'O', 'W', '8311', '955', '8643', 'D', 'e', 'z', 'M', '5139', 'o', 'a']
Example Output: 27373

Example Input: 1, 3, ['p', '5665', '3001']
Example Output: 8666

Example Input: 1, 10, ['A', '4715', 'Q', '5469', '665', 'D', 'c', '5639', 'x', 'Y', '7653', 'O', 'K', 'Q', 'X', '7709', '7781', '1591']
Example Output:
16488