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: 8, 26, ['n', '9063', 'c', 'k', '7515', 'm', '2261', '4297', '9817', '7599', '1669', 'l', '9837', '3021', 'Q', '3991', 'r', 'B', '8615', 'J', '5641', '7637', '469', '3571', '2265', '3969']

Output: 72398


Input: Consider Input: 3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']

Output: 45165


Input: Consider Input: 2, 14, ['703', '7379', 'w', 'o', '1851', 'L', 'K', 'c', 't', 'j', '765', '1263', 'k', '7969', '4095', 'I', 'G', '2961', '4697', 'U', 'y', 'W', '1443', 'n', 'c', 'G', 'C']


Output: 19227