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: 22, 25, ['875', 'x', '229', 'c', '6921', '2739', '8299', '2043', '9471', 'N', '8051', 'K', 'k', 'l', '7453', '8873', '5807', 'p', 'U', 'G', 'R', 'w', '4367', '3631', 'j', 'G', '7537', 'l', 'D', 'q']

Output: 7998


Input: Consider Input: 2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

Output: 12269


Input: Consider Input: 1, 4, ['3813', 'V', '1971', '7725', '7047', '2403', '6301']


Output: 13509