Given an array A of N integers, you

Given an array A of N integers, your task is to identify if there exists a set of exactly
three elements A[i], A[j] and A[k] such that their summation equals to a given query
value. Moreover, i, j and k must be different. There will be multiple query values. For
each query, you have to identify if there exists such set.
Input
• The first line of input contains two integers N (1≤ N ≤ 600) and M (1≤ M ≤200)
representing the number of elements in the array and the number of queries.
• The second line contains N integers representing the value in the array A where
(−500,000,000≤ A[i]≤500,000,000) . The array A is already sorted.
• The third line contains M integers representing the queries. Let q be the query
value, (−500,000,000≤ q≤ 500,000,000)
Output
There must be exactly M lines. Each line contains a word “YES” or “NO” depends on
if there exists a pair of elements of A the sum of which equal to each query respectively.

ผลลัพธ์ (อังกฤษ) 2:

Given an array of N integers A, Task is to Identify if your there exists a SET of exactly
Three Elements A [I], A [J] and A [K] such that their summation equals to a Given Query
Value. Moreover, i, j and k must be different. There will be multiple query values. For
each Query, You have to Identify if there exists such SET.
Input
• The First line of input contains integers N Two (1≤ N ≤ 600) and M (M 1≤ ≤200)
representing the Number of Elements in the array and. Number of the queries.
• The Second line contains N integers representing the Value in the array where A
(-500,000,000≤ A [I] ≤500,000,000). The array A is already sorted.
• The third line contains M integers representing the queries. Let Q be the Query
Value, (-500,000,000≤ Q≤ 500,000,000)
Output
There must be exactly M Lines. Each line contains a Word "YES" or "NO" depends on
if there exists a pair of Elements of A Equal to the Sum of which each Query respectively.

ผลลัพธ์ (อังกฤษ) 3:

Given an array A of, N integers your task is to identify if there exists a set of exactly
three elements A [], [] I A J and. A [] such k that their summation equals to a given query
value. Moreover I, J and, K must be different. There will be multiple. Query values. For
each query you have, to identify if there exists such Input set.

.Education The first line of input contains two integers N (1 < = N < = 600) and M (1 < = M < = 200)
representing the number of elements in. The array and the number of queries.
- The second line contains N integers representing the value in the array A where
(− 500 000 000 < =,,, A [i] < =,, 500 000 000). The array A is already sorted.
- The third line contains M integers representing the queries. Let Q. Be the query
.Value, (− 500 000 000 < =,,,, Q < = 500 000 000)

There Output must be exactly M lines. Each line contains a word "YES." or "NO depends." On
if there exists a pair of elements of A the sum of which equal to each query respectively.

.