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: 5, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']

Output: 36237


Input: Consider Input: 9, 9, ['y', '689', 'X', 'X', 'u', '1839', '8779', 'O', 'O', 'A', '1559', 'A', 'U']

Output: 0


Input: Consider Input: 3, 7, ['9873', '3895', '6569', 'P', '2423', '7863', 'G', '3729', '1679', 'z', 'i', '7413', '6857', 'F', '8067', '4751', '6469']


Output: 16855