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, 22, ['t', '8483', '8799', 'W', 'l', '2567', '2787', 'L', 'G', 'T', '5765', '5029', '8059', '8505', '6905', 'Z', '8153', 'e', 'K', '3529', 'g', '2667', '6629', 'O']

A: 53966
****
Q: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']

A: 30392
****
Q: 1, 9, ['729', '597', 'j', '5711', '3205', '9721', 'w', '3073', '9239']

A:
32275
****