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: 1, 4, ['o', 'O', '7355', 'S', '2513', 'f', '4189']

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

A: 41058
****
Q: 15, 16, ['k', '6511', '1949', '6757', '3715', 'Z', 'C', '5839', 'c', '2709', 'u', 'h', '4037', '3919', '7649', '7969', '9719', 'C', 'z', '1181', '9497']

A:
15618
****