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

8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']
34373

6, 8, ['C', '9459', '7617', 'r', 'L', '8655', '6993', 'g', '9997', '1151', '2063', 'r', '8089']

15648