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.

Q: 16, 20, ['8615', '8269', 'k', 'R', 'l', '9823', '6879', '7777', 'w', '8443', 'W', '6951', 'Q', '8251', 'M', 'g', 'F', 'w', 'C', '7267', 's', '973', '4703', '8921']

A: 7267
****
Q: 4, 8, ['3573', '9813', '3867', 'i', '5291', '1987', '9811', 'A']

A: 17089
****
Q: 20, 23, ['y', 'f', 'b', '7389', 'm', '6689', '5849', '9977', '9515', '5241', '1515', '45', 'y', 'V', '7929', '1131', 'Q', '9421', 'z', 'f', 'i', 'R', 'T', '3371']

A:
0
****