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.
13, 27, ['6447', '8677', 'z', '7975', 'x', '1515', 'x', '1957', 'a', 'X', '5437', '7601', 'T', 'U', 'a', 'W', 'r', 'd', 'r', '3491', 'f', 'g', 'd', 'X', 'H', 'm', '9963']