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, 19, ['u', 'x', '1103', 'K', 'N', 'o', '1943', 'Z', 'r', 'B', 'N', 'e', '7289', 'S', '325', 'G', 'x', 'D', '9005', 'y', '1729', '961', '4621', 'D', 'u', '1235']
Example Output: 19665

Example Input: 6, 16, ['4469', '9515', 'z', '153', '123', '787', '3795', '1737', '6047', 'l', '165', 'C', 'p', '5221', 'M', '4149', 'L']
Example Output: 21901

Example Input: 11, 24, ['Q', '7295', '4695', 'b', 'm', '5053', '2385', 'i', '8465', '6431', '1021', '9455', 't', '7155', '7461', '8893', '2869', '9301', 'w', 'D', '3011', '4093', 'v', '3873', 'o']
Example Output:
57132