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: 1, 1, ['d', '6481']

Output: 0


Input: Consider Input: 2, 8, ['4225', 'k', '4097', '4459', '8125', '431', '495', 'Z']

Output: 17607


Input: Consider Input: 10, 11, ['5375', 'b', 'd', '2543', 'g', 'r', '6555', '7777', 'N', 'E', '2579']


Output: 2579