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, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Output: 22632


Input: Consider Input: 1, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']

Output: 23479


Input: Consider Input: 3, 10, ['r', 'g', 'h', '9823', 'C', 'V', 'f', 'Q', 'm', 'Y', '7681', 'f', 'n']


Output: 9823