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: 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']

A: 34373
****
Q: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']

A: 19497
****
Q: 6, 11, ['y', '3011', 'E', '4393', 'h', 'Y', 'n', 'J', '2363', 'P', '8361', '2891', 'F']

A:
10724
****