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: 1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']
Example Output: 25374

Example Input: 2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']
Example Output: 9385

Example Input: 8, 18, ['P', '153', 'O', 'B', 'a', '3925', 'x', '1067', '7593', 'B', 'L', '1', 'g', '3039', 'a', '7159', '3205', '7639', '3309', '3699', '7251', '7937', '7835', '9147', 'P', 'y', 'u', '9167']
Example Output:
29703