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: 3, 4, ['4845', '7313', 'P', 'A', '2285', 'C', 't']

Output: 0


Input: Consider Input: 2, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']

Output: 8886


Input: Consider Input: 8, 21, ['3481', 'v', '5217', 'K', 'K', 'T', 'o', 't', '5657', '6193', '2141', 'm', '6535', '9795', '5495', '9007', 't', '9079', '7405', '4241', 'X', '1449', 'W', 'o']


Output: 65548