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: 9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']

A: 15061
****
Q: 16, 20, ['7527', '5121', 'Q', '4585', '9735', 'Y', 'e', 'p', '755', '8605', 'B', 'O', 'X', '3887', 'M', '8347', '2391', 'v', 'F', '5509', 'e', 'g', 'm', 'j', 'P', 'J']

A: 16247
****
Q: 1, 14, ['a', 'j', '1299', 'T', '937', 'n', 'L', 'F', 'U', 'F', 'W', 'F', '7241', 't', 'Z', '2901', 'D', 'K', '3705', 'M', 'Z', '4325', 'G', '3789', 'w', 'S', '4671']

A:
9477
****