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: 6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']

A: 6313
****
Q: 6, 16, ['4469', '9515', 'z', '153', '123', '787', '3795', '1737', '6047', 'l', '165', 'C', 'p', '5221', 'M', '4149', 'L']

A: 21901
****
Q: 10, 18, ['T', 'j', 'R', 'X', 'E', 't', '5047', '2695', '8191', 'V', 'u', '8655', '5893', '957', 'C', '7427', 'P', 'q', '5043', 'T', '9665', 'v', 'r', 'w', 'd', 'Q', 'o']

A:
22932
****