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, 3, ['h', 'w', '3397']

Output: 3397


Input: Consider Input: 3, 19, ['4723', 'r', 'b', 'I', '7639', 'x', 'j', '1697', '8525', '4083', 'i', '1337', 'Q', '3705', '4229', 'L', '3721', 'g', '2569', 'j', '447', '2421', '9513', 'p', '6663']

Output: 37505


Input: Consider Input: 10, 13, ['K', '3559', 'G', '9475', 'U', 'O', 'F', '1153', '8307', 'I', 'V', '7193', 'b', '1751', 'T', '4133', 'g', '7459', 'u', '6221', '3231', 'e']


Output: 7193