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:
6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']

Ex Output:
0


Ex Input:
25, 26, ['9367', 'G', 'c', '4997', 'g', 'r', '2893', 'T', '6693', 'I', '5127', 'N', '4333', '6905', '8539', 't', 'y', 'f', '8341', 'e', 'g', '8749', '3525', 'g', '6263', '321']

Ex Output:
6584


Ex Input:
5, 30, ['9603', '4231', 'k', 'v', 'j', 'k', 'u', 'b', 'v', 'L', '3957', '7111', '9175', '6285', '2709', 'c', '9895', '669', '9395', '3729', '5787', 'D', '8525', 'g', '5355', 'o', 'z', 'd', 'l', 'r']

Ex Output:

72592