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, 4, ['u', '5041', 'E', 'U', 'a', 'd']

Output: 0


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: 6, 7, ['3379', '239', 's', 'Y', '8879', '253', 'H', 'R', '4977', 'm', '5785', '2371', 'O', 'a', 'E', 'r', 'F', 'P']


Output: 253