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.

Input: Consider Input: 7, 12, ['8785', '221', 'f', 'f', '5743', '4839', '9389', '4759', '1493', 'a', '4951', 'K', '8501', '3331', '2069', '2713', 'j', '7557', 'p', '7679', 'S', '6499', 'E', '439', 't', 'P', 'i', 'u', '8401', 'o']

Output: 20592


Input: Consider Input: 3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Output: 22632


Input: Consider Input: 5, 17, ['N', 'F', 'o', 'T', 'y', 'P', '2083', 'Y', 'R', 'h', '209', 'Y', 'k', '37', 'L', 'U', '9791', '4983', 'V', 'S', 'G']


Output: 12120