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, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

A: 12269
****
Q: 2, 12, ['Y', '5063', 'S', 'u', 'k', 'i', '7319', '6513', '9547', '6537', 'h', '6079', '8767', '2057', '1063', 'l']

A: 41058
****
Q: 7, 18, ['g', '3811', '7945', '2403', '8419', 'O', '1939', 'L', 't', 'J', 'C', 'Z', 'v', '9941', 'x', 'e', 'Z', 'W', 'b', '2807', '5147', 'p', '7781', '8097', '5317', '1051', 'h', 'z', '7609', '171']

A:
11880
****