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, 22, ['4123', '6299', '2781', '759', 'f', 'A', 'X', '2549', 'K', '8119', '8725', 'e', 'I', 'S', '1429', 'd', '8051', 'Q', 'y', '1045', '763', 't', 'J', 'J', '169', 'b', '721']
[A]: 9859


[Q]: 5, 8, ['3017', '2471', 'r', 'M', '8213', '4259', '8397', 'A', '9809', '5827', '4079', 'v', '6735', 'T', 'n', '3877', '9777', '1395', '9631']
[A]: 20869


[Q]: 3, 16, ['9833', '9707', 'b', 'B', '2277', 'f', 't', '4337', 'Q', '7861', '4849', '4463', 'n', 'O', 'U', '9757', 'O']
[A]:
33544