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: 5, 12, ['1699', '6521', '1705', '8871', 'C', '8963', '8657', 'E', '2693', 'e', 'S', 'a', 'M', '289', '6037', '2663', 'w', 'e', 'X', '2973', 'j', 'f', '1609', '2759', 'P', 'l', 'k', '4463']

A: 20313
****
Q: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']

A: 4452
****
Q: 1, 5, ['9507', '261', 'u', 'S', 'g', 'v', 'X', '9401', '2173', '1331', '2107', '8007', 'c', 'c', '6407', '6803', 'i', 'M', '3765', 'L', 'Q', 'y', 'O']

A:
9768
****