# CodeSkulptor runs Python programs in your browser.

# Click the upper left button to run this simple demo.

# CodeSkulptor runs in Chrome 18+, Firefox 11+, and Safari 6+.
# Some features may work in other browsers, but do not expect
# full functionality. It does NOT run in Internet Explorer.
def add(m, l):
#print range(int(l[0]),int(l[2])+1)
#print range(int(l[1]),int(l[3])+1)
for i in range(int(l[0]),int(l[2])+1):
for j in range(int(l[1]),int(l[3])+1):
m[i-1][j-1] += 1
return m
def rest(m, l):
#print range(int(l[0]),int(l[2])+1)
#print range(int(l[1]),int(l[3])+1)
for i in range(int(l[0]),int(l[2])+1):
for j in range(int(l[1]),int(l[3])+1):
m[i-1][j-1] -= 1
return m
def calc(m,l):
sum1=0
for i in range(int(l[0]),int(l[2])+1):
for j in range(int(l[1]),int(l[3])+1):
sum1 += m[i-1][j-1]
return sum1
rowCol=raw_input()
li = rowCol.split()
n=int(raw_input())
dataLis=[]
for i in range(n):
data=raw_input()
li2 = data.split()
dataLis.append(li2)
##print dataLis
#mat = []
#for i in range(int(li[0])):
#
mat.append([])
#
for j in range(int(li[1])):
#
mat[i].append(0)
mat = [range(int(li[0])) for i in range(int(li[1]))]
#print mat
for i in range(n):
if dataLis[i][0] == 'a':
#print 'a'
mat = add(mat, dataLis[i][1:])
elif dataLis[i][0] == 'r':
#print 'r'
mat = rest(mat, dataLis[i][1:])
elif dataLis[i][0] == 'q':
#print 'q'
suma=calc(mat, dataLis[i][1:])

print suma
***********************************************************************
def add(m, l):
#print range(int(l[0]),int(l[2])+1)
#print range(int(l[1]),int(l[3])+1)
for i in range(int(l[0]),int(l[2])+1):
for j in range(int(l[1]),int(l[3])+1):
m[i-1][j-1] += 1
return m
def rest(m, l):
#print range(int(l[0]),int(l[2])+1)
#print range(int(l[1]),int(l[3])+1)
for i in range(int(l[0]),int(l[2])+1):
for j in range(int(l[1]),int(l[3])+1):
m[i-1][j-1] -= 1
return m
def calc(m,l):
sum1=0
for i in range(int(l[0]),int(l[2])+1):
for j in range(int(l[1]),int(l[3])+1):
sum1 += m[i-1][j-1]
return sum1
rowCol=raw_input()
li = rowCol.split()
n=int(raw_input())
dataLis=[]
for i in range(n):
data=raw_input()
li2 = data.split()
dataLis.append(li2)
##print dataLis
#mat = []
#for i in range(int(li[0])):
#
mat.append([])
#
for j in range(int(li[1])):
#
mat[i].append(0)
mat = [0]*int(li[0])
for i in range(int(li[0])):
mat[i] = [0]*int(li[1])
#print mat
for i in range(n):
if dataLis[i][0] == 'a':
#print 'a'
mat = add(mat, dataLis[i][1:])
elif dataLis[i][0] == 'r':
#print 'r'
mat = rest(mat, dataLis[i][1:])
elif dataLis[i][0] == 'q':
#print 'q'
suma=calc(mat, dataLis[i][1:])
print suma
********************************************************************
Fin=raw_input()

li=Fin.split()
K = li[0]
N = li[1]
#mat = [range(int(li[0])) for i in range(int(li[1]))]
#print mat
matCow = []
for i in range(int(N)):
temp=raw_input()
caw=temp.split()
matCow.append(caw)
print matCow
**************************************************************************
def isPal(s):
if len(s)==1:
return True
elif s[0] != s[-1]:
return False
else:
return isPal(s[1:-1])
def isBi(year):
if int(year)%4 != 0:
return 0
elif year%100 != 0:
return 1
elif year%400 !=0:
return 0
else:
return 1
t=int(raw_input())
year=[]
for i in range(t):
year.append(raw_input())
biMat=[]
for i in range(t):
biMat.append(isBi(year[i]))
print biMat
print year
monthDay = {('1','01'):31, ('2','02'):28+biMat[0], ('3','03'): 31, ('4','04'):30
, ('5','05'):31, ('6', '06'):30, ('7', '07'):31, ('8', '08'):31 , ('9','09'):30,
('10'):31, ('11'):30 ,('12'):31 }
print '01' in monthDay.keys()
print isPal('11011')
print monthDay[('01')]
Mdyy = []
MMdyy = []
Mddyy = []
MMddyy = []
Mdyyyy = []
MMdyyyy = []
Mddyyyy = []
MMddyyyy = []

**************************************************************
url=raw_input()
n=int(raw_input())
baseU=[]
for i in url:
baseU.append(hex(ord(i)))
targ = []
targ2BeCon=[]
for i in range(n):
temp=raw_input()
targ2BeCon.append(temp)
for i in range(n):
for j in targ2BeCon[i]:
targ.append(j)
tarU=[]
for i in targ:
tarU.append(hex(ord(i)))
##xor
emperejar=[]
if len(tarU)<len(baseU):
emparejar=baseU[:len(tarU)]
elif len(tarU)>len(baseU):
emparejar=baseU*(len(tarU)/len(baseU))+baseU[:(len(tarU)%len(baseU))]
else:
emparejar=baseU[:]
tarF = tarU^emparejar
print tarF

print targ
print tarU