Two Sum in Sorted Array

Given a sorted array and a target value, determine whether two elements at different positions add up to the target, using the two-pointer technique.

Input Format

The first line contains two integers N and target. The second line contains N space-separated integers in non-decreasing order.

Output Format

Print 1 if such a pair exists, otherwise print 0.