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, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']
Example Output: 22632

Example Input: 11, 16, ['8617', '6133', '5505', '6601', 'y', 'a', '1019', 'r', 'P', 'd', 'P', '9647', '9831', 'I', 'z', 'k', '749', '8975']
Example Output: 19478

Example Input: 1, 2, ['f', 's', '8403', '6677', '8893', 'T', '8561', '4973', '7861', 'x', 'w', 'C', '5815', '8509', 'b', '417', 'l', 'p', '491', 'T', 's', '1057', '829', 'V', 'X', '439', 'k', 'B', 'H']
Example Output:
0