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.
20, 23, ['9959', '8109', 'e', '3601', '6513', 'N', 'R', 'R', 'J', '7727', 't', '2697', '25', '4241', '2943', 'Z', '7617', 'L', '2513', '1537', 'f', '3253', 'P', 'C', 's', '4435']