Count Bipartite Graphs

You are given two integers m and n representing the number of nodes in two disjoint sets U and V respectively. A bipartite graph is a graph in which every edge connects a node in U to a node in V. In such a graph each possible edge between a node in U and a node in V may either be present or absent.

Your task is to calculate the number of different bipartite graphs that can be constructed. The answer is given by the formula: \(2^{m \times n}\).

inputFormat

The input consists of a single line containing two integers m and n separated by space. You can assume that the values are small enough for direct computation.

outputFormat

Output a single integer representing the number of different bipartite graphs that can be constructed.

2 3

64