#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < int(Y);++(X))
#define rrep(X,Y) for (int (X) = int(Y-1);(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < int(Y);++(X))
#define peat(X,Y) for (;(X) < int(Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(5);
  int i,j,k;
  double x,y,a,b,c,d;
  cin>>x>>y;
    double l=0,r=1;
    rep(i,100000){
      c=(l+r)/2;
      a=x-c;
      b=y-a;
      d=1-a-b-c;
      if(a<0 || 1<b || d<0)
	r=c;
      else
	l=c;
    }
    cout<<c<<" ";
    l=0,r=1;
    rep(i,100000){
      c=(l+r)/2;
      a=x-c;
      b=y-a;
      d=1-a-b-c;
      if(1<a || b<0 || 1<d)
	l=c;
      else
	r=c;
    }
    cout<<c<<endl;
  return 0;
}