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.
12, 12, ['3759', 'P', '1833', '9805', '7651', '1893', '5137', 't', 'Y', 'E', '3543', 'b', 'r', 'D', '2281', 'u', 'P', 'N', 'n', '4013', 'G', 's', 'D', 'q', 'S', '2395', '8897', '4365', 'U']