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.
11, 26, ['4925', '1895', 'E', 'R', '645', 'Q', '4303', '7995', 'u', 'P', 't', 'h', 'D', '3711', 'i', 'l', '9171', 'R', 'j', '3895', 'u', '5867', '2525', '5795', '9215', '7695', '6093', '6861', '1573', 'R']