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:
5, 10, ['7435', 'B', '7841', '5901', 'I', '6255', 'g', 'F', 'D', '1839', '3651', 'Q', '1629', 'T', '3423', 'y', '9597', '8453', '8541', 'a', '357', 'k', 'P']

Ex Output:
8094


Ex Input:
6, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']

Ex Output:
0


Ex Input:
21, 23, ['Z', 'T', 'c', '6739', 'X', '6681', 'g', '6911', 'F', 'z', 'u', '9037', '3011', 'b', '289', 'B', '5779', '8589', 'I', 'P', '5001', 'y', '3349', 'A']

Ex Output:

8350