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.

3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
14032

1, 5, ['V', '9481', '9901', '7235', '5281', '2719']
31898

10, 17, ['6337', '35', 'C', 'G', '6213', 'D', 'D', '115', '3285', '5195', '5059', 'T', 'n', 'o', 'n', '7119', '9403', 'a', '7841', '973', '5009', '8361', '2045', '1277']

26776