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.
2, 15, ['201', 'p', '7303', 't', '9729', 'K', 'D', 'K', '3835', 'C', '4535', '1161', '9613', 'H', '3337', 't', '8989', '6491', 'R', '1925', 'e', '2871', 'c', '9847', 'E', 'M']