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, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']

Ex Output:
62091


Ex Input:
4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']

Ex Output:
3201


Ex Input:
11, 23, ['2435', 'D', '2441', 'n', 'B', '3837', '7137', 'N', 'D', '4531', '7881', '5315', '8373', 'D', 'C', 'q', 'I', 'Z', '7761', '9051', '19', '1075', '1925', '143', '473', 'J', 'h']

Ex Output:

41400