Others Set 3

Given three numbers A, B, C you have to write a function named calcSum() which takes these 3 numbers as arguments and returns their sum.

Input:
The input line contains T, which denotes the number of testcases. Then T test cases follow. Each test case consists of a single line which contains three space separated integers A, B, and C.

Output:
Corresponding to each testcase, output sum of A, B and C in a new line.

User Task:
Since this is a functional problem you don't have to worry about input, you just have to complete the function calcSum().

Constraints:
1 <= T <= 105
1 <= A <= 10²
1 <= B <= 10²
1 <= C <= 10²

Example:
Input:
3
1 2 3
5 6 7
2 5 3Output:
6
18
10

Ankush challenges Ankit to complete his code which implements the functionality of checking if the first and last name of a student is an anagram of each other or not.

An anagram of a string is another string that contains same characters, only the order of characters can be different. For example, “act” and “tac” are anagram of each other. Invest your time to study the locked code and complete it accordingly.

Input:
The first line contains the number of test cases, each test case consists of one line input containing 2 space separated strings representing the first and last name of the student.

Output:
For each test case T, the output should consist of a single line - ANAGRAM or NOT ANAGRAM depending upon if the 2 given strings are anagram of each other or not.

Constraints:
1 <= T <= 100

Example:
Input:
2
rahul garg 
ankit kitan

Output:
NOT ANAGRAM
ANAGRAM

Mytat is hosting a contest and N students are interested in it. But some of them are friends. Mytat wants to make two teams such that no two friends are on the same team.  The task is to check is it possible for the mytat two make two teams or not

Note:
1. All the students are numbered from 1 to N.
2. If A is a friend of B and B is a friend of C, that doesn't mean that A is friend of C

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two space_separated integers N and M.
3. Next M lines contain two space-separated integers u and v, represents u is a friend of v

Output: For each test case, print the "yes" if possible, otherwise print "no" (without quotes).

Constraints:
1. 1 <= T <= 100
2. 2 <= N <= 50
3. 0 <= M <= min(1000, N*(N-1)/2)


Example:
Input:
2
4 2
1 2
3 4
3 3
1 2
2 3
3 1

Output:
yes
no