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.

Ex Input:
1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']

Ex Output:
24200


Ex Input:
5, 13, ['8179', '2435', 'w', '6965', '2003', 'c', '2091', 'w', '225', 's', 'k', '4281', '1931', '3351', 'o', 'f', 'Y', 'm', '8223', 'X', 'H', 'X']

Ex Output:
10531


Ex Input:
11, 14, ['6485', 'V', '8993', 'i', 'z', 'U', 'G', '1361', '4269', '53', '7267', 'a', 'B', 'P', 'z']

Ex Output:

7267