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: 5, 15, ['5049', '2581', '4617', 'b', 'c', 'z', '8247', 'd', '1413', '7797', 'K', 'T', '9009', 'V', '5179', '1643', '3923', '4885', 'j', '6717', 'D', 'D', 'O', '5777', 'W', 'J', '6267', 'e']

Output: 31645


Input: Consider Input: 3, 8, ['3403', 'r', '7273', 'g', 'O', 'A', '123', '2839', 'g', 'R', 'f', 'y', 'F']

Output: 10235


Input: Consider Input: 7, 10, ['A', 'd', '7165', 'G', '7855', 'b', '8011', '9059', '8191', '3595', 'a', 'c', '5871', 'U', '9587', 'X', 'j', 'E', 'b', '527', 't', 'D', 'y', '8869', '8925', '6265']


Output: 28856