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: 1, 2, ['4857', '6373']

Output: 11230


Input: Consider Input: 10, 14, ['u', 'o', 'V', '8223', '365', 'u', '8971', '4209', 'E', 'I', '3385', '5521', '1329', 'b', 'C', '5707', '1807', '2859', '7443', '8141', 'u', '6269', '5781', 'T', 'N', 'R', 'C']

Output: 10235


Input: Consider Input: 6, 9, ['1625', 'i', 'H', '7393', '4065', 'Q', '5733', 'I', '1953', '1281', 'M', 'z', 'i', '6221', '5609', 'P', '6667', '8823', 'H', 'O', '7723']


Output: 7686