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:
7, 17, ['149', 'O', 'h', '7873', '9227', '5655', '8945', 'I', 'c', 'V', 'Z', 'I', 'L', '1153', 'L', 'Y', '2031', 'B', 'S', 'x', 'u', '2483', 'M', '2469', '4991']

Ex Output:
12129


Ex Input:
2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']

Ex Output:
12664


Ex Input:
1, 4, ['I', 'o', '7211', 'n', '7369', 'v', 'M', '8069', '7231', '5405', 'G', '5223']

Ex Output:

7211