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.

Example Input: 17, 18, ['449', '4995', 'M', '245', 'i', '6859', 'A', '3527', '7063', 'l', '2869', 'Z', '8739', '7057', '4815', '3263', 'P', 'l', '393', 'P', '1701', '5135', 'G', 'O', 'y', 'o', '3815']
Example Output: 0

Example Input: 3, 4, ['L', 'D', 'T', 'b', 'i', 'X', '7319', '8655', '3183', '1833']
Example Output: 0

Example Input: 7, 8, ['5383', 'u', '8725', 'R', 'J', 'X', 'q', '9249', 'F', '7101', 'B', '2945', 'i', '9925', 'v', 'i', '2201', '5245', '741', '9941', 't']
Example Output:
9249