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: 1, 2, ['4319', '3495']

Output: 7814


Input: Consider Input: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']

Output: 36593


Input: Consider Input: 17, 19, ['I', 'J', '181', 't', 'S', '333', 'X', '4377', 'L', '9545', 'g', 'S', 'K', '7167', 'g', '8077', '8001', 'n', 'A']


Output: 8001