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: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']
Example Output: 5121

Example Input: 5, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']
Example Output: 7459

Example Input: 9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']
Example Output:
4364