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, 15, ['9425', '4725', 'o', 'E', '5195', 'I', '5731', 'S', '1119', 'w', '5687', 'z', 'l', '9555', '8963', 'v', '2639', 'P', 'C', 'g', '4865', 'q', '9835', 'h', 'W', 'B']