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.

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

3, 13, ['9585', '4573', '8113', '4163', 'D', '4641', '2077', 'D', '5339', 'Y', 'Z', '9133', '9401', 'o', '5033', 'd', '1745', '1357', '5513', '5369', 'N', '9355', 'C', 'W', 'C']
42867

2, 23, ['8877', '8821', '673', '9051', '8311', '1903', '1155', '1931', 's', '2775', 'V', '9597', 'D', 'h', 'w', 'j', 'J', 'G', 'K', '7453', '5519', 'h', '8023', '3811', 'Y', 'd', '3375', 'm', '5767', 'L']

65212