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, 9, ['5655', '7555', 'T', '3387', 'G', '9547', 'Z', '8679', '1561', 'E', '469']

Ex Output:
30729


Ex Input:
1, 2, ['1811', 'K', '3343', 'e']

Ex Output:
1811


Ex Input:
3, 10, ['L', 's', 'o', '1257', '2869', '573', '2713', 'k', '1847', 'u', '5379']

Ex Output:

9259