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: Consider Input: 4, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']

Output: 13650


Input: Consider Input: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']

Output: 21080


Input: Consider Input: 6, 11, ['E', 'g', 'K', 'g', '8801', 't', '1517', '4619', 'h', '8397', '4671', 'G', '4369']


Output: 19204