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: 9, 16, ['8223', '3639', '9643', '4457', 'q', 'q', '8831', '3521', 'h', 'H', 'C', '3965', 'a', '1559', 'u', '9189', '5355', 'u', 'h', 'y', 'D', 'p', 'S']

A: 14713
****
Q: 11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']

A: 7973
****
Q: 2, 9, ['6469', 'Y', '6285', '5279', '2103', 'n', 'L', '2989', '7133', 'P', '241', '6289', 'f', 'X', '6027', 'U', '6423', 'X', '2503', 'G', 'l', '1163', 'h', '3207']

A:
23789
****