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: 10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']
Example Output: 11263

Example Input: 1, 2, ['1769', '5285', 'g', '9451', '1845', 'X', '6375']
Example Output:
7054