Given the set , we define as the number of its -element subsets whose sum of elements is congruent to modulo . For example, , since the set has four -element subsets having an odd sum of elements, i.e.: , , and .
Given integers , , , and , find modulo .
The only line of each testfile contains five space-separated integers: , , , and .