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: 2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Output: 1351


Input: Consider Input: 5, 13, ['V', 'B', '7083', 'o', 's', 'd', 'I', 'b', 'v', 'r', '6189', 'u', 'G', '5733', 'u', '5663', 'i', '3109', 'X', '5713', 'H']


Output: 6189