give the ans in c Language...

Input: Each instance will have n e N followed by a1, Q2,..., an E N, and a number ke N. O Format: n an In ai a2 kin Goal: Check if there exists a contiguous subarray that has sum k. More precisely, check if there exists 1 Ssst Sn such that i, a; = k. Output: o If 8, t as above exist, then print 1 o Else print o Remark: Every 3 lines of the input forms one input instance. Process each input instance as it is received. Stop at EOR See public test cases for examples