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:
2, 22, ['Y', '203', 'i', 'b', '2019', '7785', 'u', '9161', 'k', '6543', 'h', '5221', 'Z', 'i', 'B', '4521', 'I', 'Z', '4959', '8841', 'd', 'p', 'i', 'R', 's', '7297', 'y']

Ex Output:
49253


Ex Input:
9, 16, ['v', '5691', '4973', 'J', 'w', '539', '6957', '9953', 'L', 'c', '5879', 'b', 'g', '6681', 'C', '753', '5835', '1023', 'w', '5713', '159', 'X', 'z', 'i', '8379', '9753', '195', 'X']

Ex Output:
13313


Ex Input:
1, 5, ['F', '509', '1153', 'v', 'B']

Ex Output:

1662