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, 3, ['u', '7053', '303', '329', 'D']

Output: 7356


Input: Consider Input: 16, 18, ['o', '3669', 'M', 'M', 'R', 'r', 'o', 'P', 'q', '9939', '1807', 'F', 'J', 'a', '7773', 'I', 'A', '475', 'W', 'E', '417']

Output: 475


Input: Consider Input: 5, 8, ['1999', 'J', 'L', 'O', 'B', '6215', '5149', '1', '9459', '8435', 'X']


Output: 11365