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: 1, 1, ['d', '6481']

A: 0
****
Q: 2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']

A: 24001
****
Q: 14, 15, ['4567', '9625', 'v', 'i', 'E', 'M', 'A', 'b', 't', '7389', 'Q', '9603', 'X', 't', 'Y']

A:
0
****