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: 2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

Output: 12269


Input: Consider Input: 1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']

Output: 0


Input: Consider Input: 9, 14, ['4217', 'u', 'Y', '4903', 'A', 'y', 'F', '805', 'N', '7293', 'U', 'g', '7843', '7355']


Output: 22491