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: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']

A: 30392
****
Q: 8, 12, ['v', 'N', '8123', '1677', '5743', '8657', 'S', '5073', 'Y', 'R', '2781', '6583', 'A', '1989', 'S', '9301', 'y', 'j', '1759', 'U', '9951', 'W', '5967', 'a', 'c']

A: 14437
****
Q: 8, 18, ['Z', 'N', 's', '9733', 'T', 't', '3869', 'T', 'y', 'd', '5979', '6291', 'I', '673', 'n', 'a', '279', 'h', '4167', '265', '4563', 'S', '5881', 'O', 'x', 'f', 'f', '7477']

A:
13222
****