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: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

A: 10176
****
Q: 3, 10, ['x', '5071', '6421', '5701', 'l', '5659', 'P', '7975', 'z', 'p', 'B', 'q', '1275', 'v', '6471', 'o', 'Q', 'F', '1845', '6063', '3277', '9039', '4209', '2869', '2293', '4517', '577', '3375']

A: 25756
****
Q: 9, 12, ['3681', '3497', 'k', 'x', '9469', '3443', 'm', '5531', 'b', 'W', 'Y', 'O', 'L', '4371', 'm', '4737']

A:
0
****