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: 3, 4, ['4845', '7313', 'P', 'A', '2285', 'C', 't']
Example Output: 0

Example Input: 12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']
Example Output: 22751

Example Input: 3, 10, ['8331', 't', '5571', 'G', 'r', 'C', 'o', '9749', '495', 'y', 'F', '2717', '3099', 'U', '1107', 'j', 'A', 'l', 'D']
Example Output:
15815