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: 5, 12, ['2653', 'A', '4739', '149', 'J', '817', 'n', '9589', '965', '1545', 'r', '9061', '7973', '5769', 'Y', '5889', 'A', 'P', '5789', '9757']

Output: 21977


Input: Consider Input: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']

Output: 5121


Input: Consider Input: 11, 19, ['Y', '3435', '4909', '4719', 'h', '2271', '2255', 'Y', 'D', '1217', 'X', '9455', 'e', '2621', 'k', '79', 'X', '9837', '6509', 'T', 'o', 'T', 's', 'D', '8143', 'o', '1295', '3265', 'Q']


Output: 28501