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: 24, 27, ['7541', '8415', '3387', 'J', 'U', '1485', 'p', 'c', 'b', 'O', 'm', '4993', '499', '3927', 'e', 'h', 'g', 'x', '5859', 'y', '2543', '1769', '4715', '8359', '9225', '5191', 'T', 'U', 'm', '6157']

Output: 22775


Input: Consider Input: 1, 1, ['d', '6481']

Output: 0


Input: Consider Input: 1, 2, ['Y', 'V', '3681', 'S', 'E', 's', '9869', 'A', 'x', 'n', '2821', 'n', '3931', 'p', '261', 'e', '8563', '9843', '6775', '3129', 'q', '5319', 'l', '5827', '8061', '289', 'u', '281', 'T', '447']


Output: 0