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: 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']

Output: 0


Input: Consider Input: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Output: 0


Input: Consider Input: 13, 22, ['2485', '2313', 'L', 'm', '1987', '1807', '6923', '2577', 'K', '9537', 'S', 'V', 'f', '6193', '6295', '9421', '9357', '8911', 'q', '635', '3843', '8749', '6769', 'S', 'J', '571', 'O']


Output: 53404