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: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']

A: 5085
****
Q: 22, 25, ['875', 'x', '229', 'c', '6921', '2739', '8299', '2043', '9471', 'N', '8051', 'K', 'k', 'l', '7453', '8873', '5807', 'p', 'U', 'G', 'R', 'w', '4367', '3631', 'j', 'G', '7537', 'l', 'D', 'q']

A: 7998
****
Q: 6, 18, ['6059', '2291', 'u', 'E', 'P', 'M', '4169', 'R', 'c', '4523', 's', 'O', '6531', '7799', '6863', 'p', '37', 'e', 'q', '2543', '1193']

A:
29922
****