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: 12, 24, ['3749', 'r', '9823', 'Y', 'K', 'V', 'q', 'H', '3273', '3091', '9531', 'E', '2219', '3101', 'P', 'k', 'r', 'a', 'T', 'I', 'j', 'i', '4045', 'K', 'r']

A: 9365
****
Q: 22, 25, ['875', 'x', '229', 'c', '6921', '2739', '8299', '2043', '9471', 'N', '8051', 'K', 'k', 'l', '7453', '8873', '5807', 'p', 'U', 'G', 'R', 'w', '4367', '3631', 'j', 'G', '7537', 'l', 'D', 'q']

A: 7998
****
Q: 1, 1, ['3541', 'T', 'a']

A:
3541
****