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:
3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']

Ex Output:
45165


Ex Input:
9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

Ex Output:
8357


Ex Input:
13, 15, ['u', '1609', 'J', 'F', 'F', '6639', '2073', 'T', '5821', '3985', '3263', 'x', '485', 'j', '6275', '8311', 'z', '5439', 'P', '7393', '8277']

Ex Output:

6760