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: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']

Output: 11880


Input: Consider Input: 10, 14, ['u', 'o', 'V', '8223', '365', 'u', '8971', '4209', 'E', 'I', '3385', '5521', '1329', 'b', 'C', '5707', '1807', '2859', '7443', '8141', 'u', '6269', '5781', 'T', 'N', 'R', 'C']

Output: 10235


Input: Consider Input: 10, 15, ['2097', '5277', '7901', 'O', '5573', '7955', '751', 'A', '4223', 'l', '3131', 'M', '9703', 'R', 'l', '4877', '5465', 'Q', 'Q', '4557', 'q', 'o', 'u', '2351', 'y', '5035', '9659']


Output: 12834