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, 20, ['V', 'H', '5509', 'J', '887', '6361', '4273', '1017', '5167', 'G', 'g', '5185', '2617', 'h', 'Y', '7697', '5075', 'F', '2675', '29', 'K', '2081', 'R', '7011']

A: 23278
****
Q: 18, 24, ['3493', 'T', '2499', 'l', '543', 'Y', '2247', '2665', 'y', 'z', 'a', 'H', '1057', '2401', '5587', 'w', 'N', 'n', 's', 'H', 'u', 'N', '757', 'u', 'R']

A: 757
****
Q: 6, 7, ['5095', '3697', 'j', '9587', '3949', '525', '8683', '3405', 'r', 'j', 'x']

A:
9208
****