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: 10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']

Output: 11382


Input: Consider Input: 3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Output: 22632


Input: Consider Input: 9, 16, ['3603', 'n', 'k', 'i', '3081', '215', '5115', 'U', '5061', '1181', '7493', '6017', 'Z', '5011', 'd', '5223', '7351', '7979', '1065', 'u', 'T', 's']


Output: 29986