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, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']

Output: 4295


Input: Consider Input: 19, 23, ['8277', '3337', 'G', 'N', '2365', 'S', 'Y', 'l', '5871', '2373', '7441', '2095', 'N', 'J', 'Q', '5493', 'Q', 'g', 'E', 'i', '4825', '5543', 'i', '1737', 'y', '1463', 'r', 'F']

Output: 10368


Input: Consider Input: 5, 11, ['6485', '1335', '5553', '8205', 'C', '5777', '1229', 'b', 'y', 'u', 'G', 'n', 'R', '3039', 'Q', 'N', 'o', '8527', 'Q', 'Z', 'M', 'L', 'z', 'k', 'j', 's', '1109', '4591', '5007']


Output: 7006