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: 14, 18, ['4235', 'd', '7915', '2595', '1123', '475', '7987', '287', '4659', '45', '737', 'l', 'Z', '5245', '8021', 'g', 'D', '9801', '2327', '339']

A: 23067
****
Q: 5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']

A: 5573
****
Q: 13, 22, ['5985', '4201', 'a', 'S', '9031', '4865', '4933', 'f', 't', '7901', 'm', '3507', '6553', 'z', '4757', 'k', '7381', 'G', 'J', 'C', '4295', 'T', 'B', '3801', '2063']

A:
22986
****