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: 2, 5, ['9153', 'S', '605', '2951', 'I', 'o', '4995', '2895']

Output: 3556


Input: Consider Input: 2, 14, ['C', 'q', 'W', 'o', 'r', 'W', 'Z', '9117', 'C', '1843', 'V', 'd', 'k', 'C', '5679']


Output: 10960