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.
10, 12, ['x', '4065', 'u', '6465', 'W', '4325', '9757', 'r', 'O', 'c', '3039', 'c', '5869', '893', '4287', 'U', '199', '5791', 'X']