Graph Theory 2

View as PDF

Submit solution

Points: 3
Time limit: 1.0s
Memory limit: 64M

Author:
Problem type

You are given a graph of N nodes. Print Scam! if the graph is a scam, and Graph Theory! if it is not a scam.

A graph is a scam if it contains less than or equal to K nodes.

Input Specification

The first line and only will contain two integers, N, K (1 \le N, K \le 10^{18}).

Output Specification

Print Scam! if the graph is a scam, or Graph Theory! if it is not a scam.

Sample Input

3 4

Sample Output

Scam!

Comments

There are no comments at the moment.