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, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']

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

A: 41058
****
Q: 12, 18, ['6625', '8807', 'y', 'q', '4359', 't', '4643', '7707', 'x', 'j', 'L', '6109', '2409', '9485', '3951', '1883', '3639', 'O', '6749', 'F', '5445', '1987', '9231', '9625', 'Y', '475', '329', 'F', '4553']

A:
27476
****