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: 5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']

A: 5573
****
Q: 2, 11, ['8237', '8149', '7077', '2199', '7839', 'c', 'j', 'Y', '845', '2273', 'n', 'Q']

A: 28382
****
Q: 2, 3, ['u', 'J', '9393', 'I', 'L', '3595', 'x', '723', '7147', '2959', '9105', '1253']

A:
9393
****