Definition: 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.
Input: 6, 17, ['E', 'n', '4109', 'X', '4857', '7321', '6613', '9407', 'P', 'L', 'l', '8945', 'j', 'n', 'Q', '2471', 'o', '2225', 'V', 'r', '969', 'C', 'H', '9193', 't', '1823', 'i', '3919']

34757