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, 15, ['F', '5371', '3647', 'x', '4073', 'P', 'f', '6463', '6285', 'W', 'B', 'D', 'g', '1903', 'X', '5945', 'Q', 'Y', 'v', 'B', '7237', 'j', 'A', 'E', '873']