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, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

Output: 12269


Input: Consider Input: 12, 18, ['9047', '1191', '7027', 'b', '1877', 'n', '337', 'n', 'o', '9007', 'd', 'F', '4929', '2707', 'B', 'y', 'o', '2859', '1609', 'N', 'w', 'H']

Output: 10495


Input: Consider Input: 19, 21, ['5361', '3595', 'A', 'C', '5981', '9367', '7871', 'T', 'b', 'W', 'w', '4431', 'K', '6609', 'n', '7121', 'L', '3951', '6685', 'D', '5583']


Output: 12268