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, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']

A: 12664
****
Q: 9, 12, ['4189', '4575', 'i', 'e', 'Y', '5595', 'U', 'M', 'b', 'n', '5347', 'v', 'w', 'Z', 'F', '503', 'G', '4429', '3087', '295', 'W']

A: 5347
****
Q: 7, 19, ['I', 'M', '1453', 'F', '6013', '5439', '4851', '1929', '3875', '1567', 'w', '4139', 'V', 'y', '1511', 'i', 'c', '9799', '3885', 'r', '197', 't', '6753', '3003', 'k']

A:
31556
****