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: 1, 1, ['D', 'W', '5783']

Output: 0


Input: Consider Input: 12, 24, ['4727', 'q', 'L', '969', '6799', '6223', '8967', 'e', '8589', '4399', '3237', 'M', '5323', '1477', 'n', '1553', 'r', 'J', '4789', 'h', 'J', 'M', 'g', 's', 'N', 'O']

Output: 13142


Input: Consider Input: 21, 26, ['w', '9027', '777', '3713', '6429', 'F', '4753', '967', '7825', 'R', 'Z', 'B', 'e', 'C', '4793', '4777', 'S', '287', 'h', 'O', '9447', 'p', 'U', '7407', '9479', 'B', 'q', 'h', '237']


Output: 26333