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, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']

A: 12585
****
Q: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']

A: 5085
****
Q: 3, 22, ['U', 'm', 'b', '4243', '8869', '8429', '4987', '7115', '5769', 'j', 'Q', 'B', 'R', 'c', '3123', '2457', 'L', '2287', '429', 'J', '3553', '7407', 'P']

A:
58668
****