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.

4, 10, ['B', 'b', '6741', '9121', 'N', '2871', 'Z', '1685', '995', '8681', '8591', 'z', '7423', '8661', 'R', 'b', 'g', 'Z', '5679', '4217', 'h', '8497', '3261', '6891', '2145', 'Y']
23353

6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']
0

10, 11, ['L', 'Z', '4501', '4131', 'a', '8057', 'K', 'P', '4713', '8889', 'b', '3927', 'k', '6005', 'T', 'w', 'S', '3963', '2727']

8889