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: 9, 17, ['9485', '5729', 'N', 'v', 'H', 'j', 'K', 'D', 'R', '2515', 'O', '2001', '9877', 'p', 'Y', '8407', '647']
Example Output: 23447

Example Input: 3, 10, ['r', 'A', 'l', '7169', '3249', 'T', 'O', 'g', 'F', 'M', 'R', '171', 'M', '2449', '3749', 'f']
Example Output: 10418

Example Input: 9, 20, ['D', '9659', 'W', 'Y', '7011', 'U', 'V', 'f', '2145', '6971', 'f', 'B', '6939', '377', '2097', 'g', '6879', 'X', '5797', 'J', '8901', '5687', '3589', '8381', '3841']
Example Output:
31205