In thisproblem, we will write a program that, given an integerk, an integern, and a list of integers, outputs the number of pairs in in the list that addtok. to receive full credit for design, your algorithm must have a runtimeino(n), wherenis the length of the list of integers. your program shouldtake as input a numberkon its own line, followed by a numbernon itsown line, followed by a space-separated list ofnintegers. it should thenoutput the number of pairs in the list that add tok. order does not mat-ter when considering a pair (in other words, in the list [2,1] there is onedistinct pair that sums to 3, not two). you may assume that all numbersin the input are distinct.