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, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']

Output: 25920


Input: Consider Input: 6, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']

Output: 0


Input: Consider Input: 12, 18, ['V', '363', '531', '7005', 'Y', 'f', '469', 'g', '4483', '6099', '293', '9077', 'Q', '9697', '5367', 'x', 'g', 'I', '643', '5949', '4635', '2693', 'Z', 's']


Output: 24141