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, 2, ['j', '3613']

Output: 3613


Input: Consider Input: 11, 20, ['7193', 't', 'v', '6817', '3505', 'u', '6051', '4027', 'G', '8381', 'Z', 'T', 'q', 'M', 'o', '7645', '75', 'J', 'U', 'N', '3885', 'y', 'C', 'q', '5109', 'f', 'v']

Output: 7720


Input: Consider Input: 6, 6, ['Y', 'v', 'P', '611', 'Y', '7835', 'h', '7561', 'O', '587', '1019', 'U', '6215', 'S', '8573', '651', 'B']


Output: 7835