Petya and Vasya decided to play a little. They found n red cubes and m blue cubes. The game goes like that: the players take turns to choose a cube of some color (red or blue) and put it in a line from left to right (overall the line will have n + m cubes). Petya moves first. Petya's task is to get as many pairs of neighbouring cubes of the same color as possible. Vasya's task is to get as many pairs of neighbouring cubes of different colors as possible. 

The number of Petya's points in the game is the number of pairs of neighboring cubes of the same color in the line, the number of Vasya's points in the game is the number of neighbouring cubes of the different color in the line. Your task is to calculate the score at the end of the game (Petya's and Vasya's points, correspondingly), if both boys are playing optimally well. To "play optimally well" first of all means to maximize the number of one's points, and second — to minimize the number of the opponent's points.

Input

The only line contains two space-separated integers n and m (1 ≤ n, m ≤ 105) — the number of red and blue cubes, correspondingly.

Output

On a single line print two space-separated integers — the number of Petya's and Vasya's points correspondingly provided that both players play optimally well.

Examples

Input

3 1


Output

2 1


Input

2 4


Output

3 2

Note

In the first test sample the optimal strategy for Petya is to put the blue cube in the line. After that there will be only red cubes left, so by the end of the game the line of cubes from left to right will look as [blue, red, red, red]. So, Petya gets 2 points and Vasya gets 1 point. 

If Petya would choose the red cube during his first move, then, provided that both boys play optimally well, Petya would get 1 point and Vasya would get 2 points.
	import java.io.BufferedWriter;
	import java.io.IOException;
	import java.io.InputStream;
	import java.io.OutputStream;
	import java.io.OutputStreamWriter;
	import java.io.PrintWriter;
	import java.io.Writer;
	import java.util.Arrays;
	import java.util.InputMismatchException;
	import java.util.*;
	import java.io.*;
	import java.math.*;
	public class Main{

	static class Pair
		{ 
			int x; 
			int y; 
			// Constructor 
			public Pair(int x, int y) 
			{	 
				this.x = x; 
				this.y = y; 
			}	 
		} 
		static class Compare
		{ 
			static void compare(Pair arr[], int n) 
			{ 
				// Comparator to sort the pair according to second element 
				Arrays.sort(arr, new Comparator<Pair>() { 
					@Override public int compare(Pair p1, Pair p2) 
					{ 
						return p1.y - p2.y; 
					} 
				}); 
			} 
		}
		public static long pow(long a, long b)
		{
			long result=1;
			while(b>0)
			{
				if (b % 2 != 0)
				{
					result=(result*a);
					b--;
				} 
				a=(a*a);
				b /= 2;
			}   
					return result;
		}
		public static BigInteger fact(long num)
		{
					BigInteger fact=new BigInteger("1");
					int i=0;
					for(i=1; i<=num; i++)
					{
						BigInteger bg=BigInteger.valueOf(i);
						fact=fact.multiply(bg);
					}
					return fact;
				}
				public static long gcd(long a, long b)
				{
					if (a == 0)
						return b;
					return gcd(b%a, a);
				}
				
				public static long lcm(int a,int b)
				{
					return a * (b / gcd(a, b));
				}
				public static long sum(int h)
				{
					return (h*(h+1)/2);
				}
			/*	public static void dfs(int parent,boolean[] visited)
				{
					ArrayList<Integer> arr=new ArrayList<Integer>();
					arr=graph.get(parent);
					visited[parent]=true;
					bigParent=parent;
					for(int i=0;i<arr.size();i++)
					{
						int num=arr.get(i);
						if(visited[num]==false)
						{
							color[num]=count++;
							dfs(num,visited);
						}
					}
				}
				static int count=0;
				static int[] storing1;
			*/	static int[] storing2;
				static ArrayList<ArrayList<Integer>> graph;
				public static void main(String args[])throws IOException
				{
					InputReader in=new InputReader(System.in);
					OutputWriter out=new OutputWriter(System.out);
				//	long a=pow(26,1000000005);
				//    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
					ArrayList<Integer> ar=new ArrayList<>();
					ArrayList<Integer> ar1=new ArrayList<>();
					ArrayList<Integer> ar2=new ArrayList<>();
					ArrayList<Integer> ar3=new ArrayList<>();
					ArrayList<Integer> ar4=new ArrayList<>();
					TreeSet<String> ts=new TreeSet<>();
					TreeSet<String> ts1=new TreeSet<>();
					TreeSet<String> pre=new TreeSet<>();
					HashMap<Integer,Integer> hash=new HashMap<Integer,Integer>();
					HashMap<Long,Integer> hash1=new HashMap<Long,Integer>();
					HashMap<Long,Integer> hash2=new HashMap<Long,Integer>();
					boolean[] prime=new boolean[100001];
					for(int i=2;i*i<=100000;i++)
					{
						if(prime[i]==false)
						{
							for(int j=2*i;j<=100000;j++)
							{
								prime[j]=true;
							}
						}
					}
					int n=i();
					int m=i();
					int i=0;
					int red=n;
					int blue=m;
					char[] a=new char[n+m+1];
					while(red>0 && blue>0)
					{
						if(i==0)
						{
							a[i]='B';
							blue--;
						}
						else
						{
							if(a[i-1]=='B' && red>0 && i%2!=0)
							{
								a[i]='R';
								red--;
							}
							else if(a[i-1]=='R' && blue>0 && i%2!=0)
							{
								a[i]='B';
								blue--;
							}
							else if(a[i-1]=='R' && red>0  && i%2==0)
							{
								a[i]='R';
								red--;
							}
							else if(a[i-1]=='B' && blue>0 && i%2==0)
							{
								a[i]='B';
								blue--;
							}
						}
						i++;
					}
					int ans=0,ans1=0;
					if(red>0)
					{
						for(int j=i;j<i+red;j++)
						{
							a[j]='R';
						}
					}
					if(blue>0)
					{
						for(int j=i;j<i+blue;j++)
						{
							a[j]='B';
						}
					}
					for(int j=0;j<n+m-1;j++)
					{
						if(a[j]==a[j+1])
						{
							ans+=1;
						}
						if(a[j]!=a[j+1])
						{
							ans1+=1;
						}
					}
					red=n;
					blue=m;
					i=0;
					for(int j=0;j<n+m+1;j++)
					{
						a[j]=' ';
					}
					while(red>0 && blue>0)
					{
						if(i==0)
						{
							a[i]='R';
							red--;
						}
						else
						{
							if(a[i-1]=='B' && red>0 && i%2!=0)
							{
								a[i]='R';
								red--;
							}
							else if(a[i-1]=='R' && blue>0 && i%2!=0)
							{
								a[i]='B';
								blue--;
							}
							else if(a[i-1]=='R' && red>0  && i%2==0)
							{
								a[i]='R';
								red--;
							}
							else if(a[i-1]=='B' && blue>0 && i%2==0)
							{
								a[i]='B';
								blue--;
							}
						}
						i++;
					}
					if(red>0)
					{
						for(int j=i;j<i+red;j++)
						{
							a[j]='R';
						}
					}
					if(blue>0)
					{
						for(int j=i;j<i+blue;j++)
						{
							a[j]='B';
						}
					}
					int ans2=0,ans3=0;
					for(int j=0;j<n+m-1;j++)
					{
						if(a[j]==a[j+1])
						{
							ans2+=1;
						}
						if(a[j]!=a[j+1])
						{
							ans3+=1;
						}
					}
				//	pln(ans+" "+ans1+" "+ans2+" "+ans3);
					if(ans2>ans3 && ans2>ans)
					{
						pln(ans2+" "+ans3);
					}
					else if(ans>ans1)
					{
						pln(ans+" "+ans1);
					}
					else if(ans==ans1)
					{
						pln(ans+" "+ans1);
					}
					else if(ans2==ans3)
					{
						pln(ans2+" "+ans3);
					}
					else if(ans3>ans2 && ans3<=ans1)
					{
						pln(ans2+" "+ans3);
					}
					else if(ans<ans1)
					{
						pln(ans+" "+ans1);
					}
				}
	
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				/**/
				static InputReader in=new InputReader(System.in);
					static OutputWriter out=new OutputWriter(System.out);
					public static long l()
					{
						String s=in.String();
						return Long.parseLong(s);
					}
					public static void pln(String value)
					{
						System.out.println(value);
					}
					public static int i()
					{
						return in.Int();
					}
					public static String s()
					{
						return in.String();
					}
		}
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			class InputReader {
				 
				private InputStream stream;
				private byte[] buf = new byte[1024];
				private int curChar;
				private int numChars;
				private SpaceCharFilter filter;
			 
				public InputReader(InputStream stream) {
					this.stream = stream;
				}
			 
				public int read() {
					if (numChars== -1)
						throw new InputMismatchException();
					if (curChar >= numChars) {
						curChar = 0;
						try {
							numChars = stream.read(buf);
						} catch (IOException e) {
							throw new InputMismatchException();
						}
						if (numChars <= 0)
							return -1;
					}
					return buf[curChar++];
				}
			 
				public int Int() {
					int c = read();
					while (isSpaceChar(c))
						c = read();
					int sgn = 1;
					if (c == '-') {
						sgn = -1;
						c = read();
					}
					int res = 0;
					do {
						if (c < '0' || c > '9')
							throw new InputMismatchException();
						res *= 10;
						res += c - '0';
						c = read();
					} while (!isSpaceChar(c));
					return res * sgn;
				}
			 
				public String String() {
					int c = read();
					while (isSpaceChar(c))
						c = read();
					StringBuilder res = new StringBuilder();
					do {
						res.appendCodePoint(c);
						c = read();
					} while (!isSpaceChar(c));
					return res.toString();
				}
			 
				public boolean isSpaceChar(int c) {
					if (filter != null)
						return filter.isSpaceChar(c);
					return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
				}
			 
				public String next() {
					return String();
				}
			 
				public interface SpaceCharFilter {
					public boolean isSpaceChar(int ch);
				}
			}
			 
			class OutputWriter {
				private final PrintWriter writer;
			 
				public OutputWriter(OutputStream outputStream) {
					writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
				}
			 
				public OutputWriter(Writer writer) {
					this.writer = new PrintWriter(writer);
				}
			 
				public void print(Object...objects) {
					for (int i = 0; i < objects.length; i++) {
						if (i != 0)
							writer.print(' ');
						writer.print(objects[i]);
					}
				}
			 
				public void printLine(Object...objects) {
					print(objects);
					writer.println();
				}
			 
				public void close() {
					writer.close();
				}
			 
				public void flush() {
					writer.flush();
				}
			 
				}
			 
				class IOUtils {
			 
				public static int[] readIntArray(InputReader in, int size) {
					int[] array = new int[size];
					for (int i = 0; i < size; i++)
						array[i] = in.Int();
					return array;
				}
			 
				} 