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, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']

A: 27156
****
Q: 1, 15, ['k', 'z', 'D', '4827', '8921', 'o', 'e', 'U', 'f', '7419', 't', 'Z', 'c', '4089', '1117', '2309', '9095']

A: 26373
****
Q: 9, 11, ['6655', 'V', 'm', '3229', '2427', '9165', 'F', 'c', 'K', '3925', '1261', '1055', 'S']

A:
5186
****