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: 9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']

Output: 15061


Input: Consider Input: 6, 14, ['707', 'L', '8503', 'x', 'Y', '921', '8415', '6449', '5711', 'd', '591', 'd', '3827', '5569', 'g', 'U', 'v', '7781', 'E', 'z', '4751', '8541', 'c', 'P', '8037', 'X']

Output: 31483


Input: Consider Input: 2, 6, ['V', '9305', 'F', 'D', '59', '2399', 'o', '7291', '8263', '2467']


Output: 11763