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:
9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']

Ex Output:
12942


Ex Input:
3, 4, ['L', 'D', 'T', 'b', 'i', 'X', '7319', '8655', '3183', '1833']

Ex Output:
0


Ex Input:
5, 11, ['5181', '8749', 'z', 'n', 'E', 'p', '3665', 'O', 'l', 'J', 'g', 'Y', '9925', 'n', 'M', '2355', 'Q', '7607', 'I', 'g', '1525', 'x', '941']

Ex Output:

3665