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: 3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']
Example Output: 4295

Example Input: 1, 14, ['n', 'v', '7825', '5951', 'k', '1733', 'c', 'u', 'C', 'c', 'D', 'g', '9231', 'G']
Example Output: 24740

Example Input: 7, 11, ['S', 'b', 'M', '2825', 'I', '1127', '4311', 'Y', 'T', 'y', 'Z', 's', '7551', 'N', 'N', 'l', '179', 'V', '1', '3653', 'l', 'r', '7103']
Example Output:
4311