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.
14, 28, ['W', 'o', '4715', '8029', 'X', 'B', 'b', 'P', '7901', 'W', '1235', '8573', 'z', 'X', 'f', 'G', 'm', '3333', '5337', '381', 'C', '9135', '9091', 'M', '5521', 'Z', 'X', 'x']