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.

Example Input: 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']
Example Output: 9859

Example Input: 4, 6, ['v', 'f', '5021', 'v', 'M', '6345', '1159', 'C', '8173', '6299', 'r', '8877', 'a', 'm', 'k', '2935']
Example Output: 6345

Example Input: 1, 2, ['u', '5409', 'P']
Example Output:
5409