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.
7, 19, ['501', '6557', 'W', 'C', 'b', 'E', 't', 'N', 'k', 'r', '7069', '4643', 'i', 'M', '2713', 'r', 'w', '8967', 'd', '4941', '5095', 'w', '6435', '6695', 'M', 'p', 'U', 'Y', 'k']