Set Containment Check

You are given two sets of distinct integers. The first set is denoted as A and the second as B. Your task is to determine whether set A is a subset of set B; that is, whether every element in A is also present in B. In formal mathematical notation, you need to check if \( A \subseteq B \).

For example, if A = {1, 2, 3} and B = {3, 2, 4, 5, 1}, then A is a subset of B and the output should be True.
If A = {1, 2, 3, 4} and B = {2, 3, 4}, then A is not a subset of B and the output should be False.

The input will be provided via standard input (stdin) and the output should be printed to standard output (stdout).

inputFormat

The input consists of two lines. The first line contains 0 or more integers separated by spaces representing the elements of set A. The second line contains 0 or more integers separated by spaces representing the elements of set B. An empty line indicates an empty set.

outputFormat

Output a single line containing either True if set A is contained in set B, or False otherwise.

1 2 3
3 2 4 5 1

True