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: 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: 2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']

A: 20324
****
Q: 3, 23, ['D', 'C', 'n', '259', 'a', 'N', 'w', '7559', '9201', '2081', 'm', '6609', '447', '3429', 'd', '4073', '2397', 'k', '5111', '923', '3769', 'm', '117', '2017', '4437']

A:
45975
****