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: 10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']

A: 11263
****
Q: 4, 6, ['g', '8871', 'q', '597', '8871', '277', 'f', 'e', '2779']

A: 9745
****
Q: 1, 9, ['D', '6417', 'T', 'D', 'R', '6153', '4565', 'X', 'A', 'Q', 'T', '5479', '3405']

A:
17135
****