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: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']

Output: 26471


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: 2, 3, ['y', 'Q', 'g', 'N', '129', '7263', 'G', 'n', '8491', 'Y', '2649']


Output: 0