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: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']

Output: 9511


Input: Consider Input: 3, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']

Output: 0


Input: Consider Input: 2, 10, ['91', 'w', 'k', '1485', '5563', 'z', '9971', '8169', '8719', '7525', '6531', '8633', 'X', 'u', '8493', '9761', '4363', 'k', 'K', '593', '3903', '6857']


Output: 41432