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.
22, 23, ['6685', '6217', '5125', '959', '4013', '6409', '8103', 'b', 'P', 'M', '4207', '215', 'z', 'B', '3603', 'K', '9283', '1801', 'N', 'B', 'G', '4469', '7035', 'J', '6953', 'T', 'v', 'y', 'R']