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, 10, ['907', '3413', 'y', 'Y', 'y', '9671', '6631', 'g', '8803', '3127', 'k', 'Y', '413', '3871', '909', 'G', '4431', '6489', '7291', 'J', 'W', '6423', '641', 'G', '2545', '4471', '3717', '2671', '561']

Output: 31645


Input: Consider Input: 1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']

Output: 8063


Input: Consider Input: 12, 12, ['4037', 'i', 'A', '8383', 'v', 'K', '3765', 'D', 'o', '6999', 'e', 'w', 'k', 'U', '1717', 'W', 'C', 'M', '1589', 'c']


Output: 0