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: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']

Output: 6933


Input: Consider Input: 1, 1, ['D', 'W', '5783']

Output: 0


Input: Consider Input: 9, 12, ['q', 'b', 'r', '9317', '3245', 'M', 'P', '5931', 'N', '3095', 'x', 'q', '8323']


Output: 3095