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, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
Example Output: 7479

Example Input: 3, 15, ['i', '3795', '7239', '6365', 'i', '4003', 'v', '6905', '9227', 'u', 'e', '5621', 'M', '7481', '4721', 'I', 'e', 'o', 'K', 'f']
Example Output: 51562

Example Input: 2, 2, ['V', 'a']
Example Output:
0