Apples and Boxes

Alisha visits a fruit shop which has N boxes and each box has one or more apples in it. The shop keeper will not allow transfer of apples from one box to another. The number of apples in each of these N boxes is passed as the input. Suppose Alisha wishes to buy exactly K apples, the program has to print the distinct ways in which Alisha can pick and buy exactly K apples considering the fact that Alisha’s bike can carry only a maximum of 2 boxes.

Input Format:
The first line contains N and K separated by a space.
The second line contains the count of apples C₁ to C_N in each of the boxes separated by a space.

Output Format:
The first line contains the integer value representing the number of ways in which Alisha can pick boxes to buy exactly K apples.

Boundary Conditions:
2 <= N <= 99999
1 <= K <= 99999
1 <= C_i <= K

Note: Optimize the logic to find the count. Else Timeout will occur.

Example Input/Output 1:
Input:
7 6
1 2 3 4 3 4 2

Output:
2

Explanation:
The combinations 2,4 and 3,3 gives exactly 6.
Please note that 2,4 is same as 4,2.

Example Input/Output 2:
Input:
7 6
6 6 6 6 3 3 3

Output:
2

Explanation:
The distinct combinations are 6 (where only one box is picked) and 3,3

n,k=map(int,input().split());
l=list(map(int,input().split()))
op =[]
for i in range(n):
    for j in (l[0:i]+l[i+1::]):
        if l[i]+j==k:
            op.append((l[i],j))
op=sorted(list(set(op)))
for p in op:
    for m in op:
        if p==m[::-1] and m!=p:
            op.remove(m)
if k in l:
    print(len(op)+1)
else:
    print(len(op))