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.

Example Input: 1, 2, ['j', '3613']
Example Output: 3613

Example Input: 1, 3, ['x', '971', '3029']
Example Output: 4000

Example Input: 6, 28, ['8335', 'g', '6225', '4939', 'Y', '1215', 'Q', 'i', 'e', '4959', '8969', 'G', '9547', 'A', '4061', '4497', '3423', 'Y', 'A', 'P', 'a', 'e', 'F', 'Z', 'T', '3993', 'o', 'C']
Example Output:
40664