#include<bits/stdc++.h>
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define double long double
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
#define N 305
#define M (N*N)
const double eps=1e-10;
char s[10005];
int bra[10005],st[10005],id[10005],tp;
int L,R,D,U,len,n;
typedef bitset<M> bs;
bs r[N];
int sgn(double x)
{
	if(x<-eps) return -1;
	else if(x>eps) return 1;
	else return 0;
}
struct Vec
{
	double x,y;
	Vec(double a=0,double b=0) {x=a,y=b;}
	double norm() {return x*x+y*y;}
	double abs() {return sqrt(x*x+y*y);}
};
Vec rdvec()
{
	double x,y;
	scanf("%lf %lf",&x,&y);
	return Vec(x,y);
}
Vec operator + (const Vec &x,const Vec &y) {return Vec(x.x+y.x,x.y+y.y);}
Vec operator - (const Vec &x,const Vec &y) {return Vec(x.x-y.x,x.y-y.y);}
Vec operator * (const Vec &x,const double y) {return Vec(x.x*y,x.y*y);}
Vec operator / (const Vec &x,const double y) {return Vec(x.x/y,x.y/y);}
double dis(const Vec &x,const Vec &y) {return (x-y).abs();}
double dis(const Vec &x) {return sqrt(x.x*x.x+x.y*x.y);}
void print(Vec x) {printf("%.3lf %.3lf\n",x.x,x.y);}
double cdot(const Vec &x,const Vec &y) {return x.x*y.x+x.y*y.y;}
double cross(const Vec &x,const Vec &y) {return x.x*y.y-x.y*y.x;}
int ccw(const Vec &x,const Vec &y,const Vec &z)
{
	int w=sgn(cross(y-x,z-x));
	if(w==1) return 1; // ccw
	else if(w==-1) return -1; // cw;
	else return 0; // coline
}
struct Seg
{
	Vec s; double c; // ax+by+c>=0
	Seg(Vec x,double y=0) {s=x,c=y;}
	Seg() {}
	Seg flip() {return Seg(s*(-1),-c);}
};
Seg a[N];
vector<vector<Vec>> all,tmp;
vector<Vec> c;
vector<Vec> cut(vector<Vec> p,Seg s)
{
	vector<Vec> ans;
	for(int i=0;i<(int)p.size();i++)
	{
		double t1=cdot(p[i],s.s)+s.c,t2=cdot(p[(i+1)%(int)p.size()],s.s)+s.c;
		if(t1>=0) ans.push_back(p[i]);
		if(sgn(t1)*sgn(t2)<0)
		{
			double tv=t1/(t2-t1);
			Vec d=p[(i+1)%(int)p.size()]-p[i];
			Vec po=p[i]-(d*tv);
			assert(abs(cdot(s.s,po)+s.c)<eps);
			ans.push_back(po);
		}
	}
	return ans;
}
void init()
{
	vector<Vec> v;
	v.emplace_back(L,D);
	v.emplace_back(R,D);
	v.emplace_back(R,U);
	v.emplace_back(L,U);
	all.push_back(v);
	for(int i=1;i<=n;i++)
	{
		tmp=all; all.clear();
		Vec cv=a[i].s; double cc=a[i].c;
		for(auto v:tmp)
		{
			double mx=-1e9,mn=1e9;
			for(auto p:v)
			{
				double w=cdot(p,cv)+cc;
				mx=max(mx,w),mn=min(mn,w);
			}
			if(sgn(mx)==1) all.push_back(cut(v,a[i]));
			if(sgn(mn)==-1) all.push_back(cut(v,a[i].flip()));
		}
	}
	// for(auto p:all)
	// {
		// for(auto v:p) print(v);
		// printf("\n");
	// }
	for(auto p:all)
	{
		Vec cc;
		for(auto v:p) cc=cc+v;
		cc=cc/(double)p.size();
		c.push_back(cc);
	}
}
bs solve(int l,int r)
{
	if(s[l]=='(')
	{
		assert(bra[l]==r);
		if(s[l+1]=='!')
		{
			bs t=solve(l+2,r-1);
			t.flip();
			return t;
		}
		else
		{
			int mid=bra[l+1]+1;
			bs L=solve(l+1,mid-1);
			bs R=solve(mid+1,r-1);
			if(s[mid]=='&') return L&R;
			else if(s[mid]=='|') return L|R;
			else if(s[mid]=='^') return L^R;
			else assert(0);
		}
	}
	else if(s[l]=='[')
	{
		bs t;
		for(int i=0;i<(int)all.size();i++)
		{
			int lid=id[l];
			if(cdot(a[lid].s,c[i])+a[lid].c>=0) t[i]=1;
		}
		return t;
	}
	else assert(0);
}
signed main()
{
	cin>>L>>R>>D>>U;
	scanf("%s",s+1); len=strlen(s+1);
	for(int i=1;i<=len;i++)
	{
		if(s[i]=='('||s[i]=='[') st[++tp]=i;
		if(s[i]==')'||s[i]==']')
		{
			int u=st[tp--];
			bra[i]=u,bra[u]=i;
		}
	}
	for(int i=1;i<=len;i++)
	{
		if(s[i]=='[')
		{
			n++;
			sscanf(s+i,"[%Lf,%Lf,%Lf]",&a[n].s.x,&a[n].s.y,&a[n].c);
			id[i]=n;
		}
	}
	init();
	assert((int)all.size()<M);
	bs ans=solve(1,len);
	double sum=0;
	for(int i=0;i<(int)all.size();i++)
	{
		if(ans[i])
		{
			for(int j=1;j+1<(int)all[i].size();j++) sum+=cross(all[i][j]-all[i][0],all[i][j+1]-all[i][0]);
		}
	}
	printf("%.10Lf\n",sum/2);
	return 0;
}