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, 16, ['1165', 't', '4833', 'b', '6361', '1175', '3943', 'd', 'l', '7519', 'j', 'X', 'E', 'A', 'm', '6469', '9429', '2415', '5187', 'k', 'd', '9607', '1375', '8913', 'c', 'A', '9229']
Example Output: 30300

Example Input: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']
Example Output: 28268

Example Input: 5, 13, ['f', '2735', '9381', 'Q', '4699', 'X', 'f', 'p', '8465', '2525', '9473', '1911', 'h']
Example Output:
27073