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:
1, 2, ['t', '9343', 'g']

Ex Output:
9343


Ex Input:
1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']

Ex Output:
0


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

Ex Output:

0