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: 2, 11, ['8237', '8149', '7077', '2199', '7839', 'c', 'j', 'Y', '845', '2273', 'n', 'Q']

A: 28382
****
Q: 7, 16, ['l', '1165', '8087', 'M', '6269', '6349', 'R', 'm', 'j', '9437', '3875', 'n', 'R', 'Y', '4427', 'g', '6231', 'm', '1139', '3891', '3773', '1303', 'Y', '7347']

A: 17739
****
Q: 6, 9, ['9687', '7951', 'q', '9047', '3899', '4063', '4589', '7095', '3537']

A:
19284
****