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: 17, 21, ['7037', '9447', 'f', 'R', '1237', '5735', '1327', '1371', 'd', '3025', 'B', '9165', '3447', '6135', '3315', 'l', '8069', 'g', 'H', 'e', '4523', '3149', 'H', 'o', '3947']

A: 12592
****
Q: 5, 10, ['7435', 'B', '7841', '5901', 'I', '6255', 'g', 'F', 'D', '1839', '3651', 'Q', '1629', 'T', '3423', 'y', '9597', '8453', '8541', 'a', '357', 'k', 'P']

A: 8094
****
Q: 2, 6, ['5869', '2449', 'p', 'k', '631', '9655', 'p', 'e']

A:
12735
****