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: 9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']

Output: 4364


Input: Consider Input: 6, 12, ['q', '8055', '5233', '5529', 'T', 'h', 'w', 'w', '9449', 'W', '7903', 'b', '6925']

Output: 17352


Input: Consider Input: 5, 7, ['F', 'A', '3141', '1561', 'z', '8851', '7485', '2071', 's', '6483', '1377']


Output: 16336