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: 2, 22, ['Y', '203', 'i', 'b', '2019', '7785', 'u', '9161', 'k', '6543', 'h', '5221', 'Z', 'i', 'B', '4521', 'I', 'Z', '4959', '8841', 'd', 'p', 'i', 'R', 's', '7297', 'y']
Example Output: 49253

Example Input: 8, 9, ['3587', '5903', 'B', '9671', 's', 'A', '7259', '6961', '2601', '9719']
Example Output: 9562

Example Input: 8, 24, ['8565', '7509', 'K', '9113', 'C', '6351', 'w', '9799', 'w', 'r', 'k', 'G', '6105', 'a', '1593', 'n', 'u', '4699', 'G', 'K', '2613', '3697', 'J', '3845']
Example Output:
32351