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, 2, ['R', '979', 'H', 'W', 'y']

Output: 979


Input: Consider Input: 6, 10, ['2095', '7189', 'j', 'i', '6105', 'f', 'I', 'z', '7903', '7165']

Output: 15068


Input: Consider Input: 14, 15, ['4993', 'i', 'j', '3513', '5481', '3759', 'b', 'A', '1825', '1175', '9089', 's', 'V', 'U', '8287', 'j', 'C', 'I', '5765', '1927', '7017']


Output: 8287