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: 9, 11, ['8449', 'j', '8735', '2839', '2773', '1659', 'V', 'I', 'x', 'V', 't', '7837', 'F', 'N', '4179', 'G', 'f', '8193']
Example Output: 0

Example Input: 1, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']
Example Output: 32007

Example Input: 7, 18, ['v', '3817', '4823', 'w', 'h', '6089', '3233', '1577', 'I', 'c', 'L', 'N', 'M', '4203', 'I', '1839', 'k', '3215', 'M', '3101', '3775', '7933', 'x', 'Y']
Example Output:
14067