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, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']

Output: 20400


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

Output: 21080


Input: Consider Input: 2, 23, ['E', '1683', '837', 't', 'n', '5209', 'Y', 'E', 'i', '7891', 'F', '469', 'o', 'q', 'X', 'H', '4043', '7659', '6119', 'F', '2325', 'h', '9581']


Output: 45816