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, 4, ['3757', 'z', '9029', '6903', '7185']

Ex Output:
19689


Ex Input:
3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']

Ex Output:
59155


Ex Input:
14, 19, ['5121', 'F', '7911', 'd', '5107', '5583', '3029', '1053', '4557', '8137', 'j', '3059', 'D', '6761', 'u', '971', '6021', '6961', 'f', '7777', 'C', 'Q', '5641', '7585', 'C', '2801']

Ex Output:

20714