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: 3, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

A: 0
****
Q: 7, 15, ['k', '7859', '7463', 'f', 'd', 'L', 'O', 'K', '4629', 'n', 'T', '3785', 'I', 'o', 'Q', '8331', 'U', 'W', '2311', 'u', '5821', '9193']

A: 8414
****
Q: 9, 16, ['r', '7723', 'c', '4923', 'o', '4075', 'e', '4777', 'T', 'x', 'Q', '6665', 'k', 'T', '2697', '7305', 'S', '491', 'B', 'z', '1967', 'b', '9431', '5101']

A:
16667
****