测试数据来自 system/1693

背景

听完了美妙的葱歌版<两个人的焰火>,F慢慢从石化中恢复了回来(= =!你以为是溪风和水碧啊).复原后的F悲哀地发现已经早晨了,他要去上学了.......
......放学后
F(回到家):= =||||||无数黑线
葱歌:What happened,怎么这么囧啊?
F:我们学校......搞唱歌比赛...= =一个MM(算不算呢?其实MM是无所谓有,无所谓无的......)唱了一首很多年前的老歌...实在太老了...老得我囧.现在脑子里全是这歌.
葱歌:是不是Nobody啊?我也会唱哦~~
F(黑线++):不要啊~

描述

众所周知的(什么?你不知道?去百度一下),Nobody的团舞里有一个经典动作(那是相当的经典,经典了好几年),而这个动作是对称做两遍的.葱歌很喜欢这个动作(Mikuer们不要BS我...),她很想多做这个动作.
但是邪恶的F,为了少看这无语的动作,给了葱歌两排非负整数.一排A数,一排B数.A数有n个,B数有m个.如果一个A数和一个B数的二进制表示法中,每一位都不一样的话(不足的数高位补0),则A和B能够组成一个"对称音".每个数只能属于一个"对称音".葱歌想要最多的对称音,让她可以尽量多跳那个动作.

格式

输入格式

输入共3行.
第1行两个正整数n,m,表示A数n个,B数m个.
第2行n个非负整数,表示n个A数.
第3行m个非负整数,表示m个B数.

输出格式

一行一个正整数,表示最多能得到的"对称音"个数.如果一个对称音都得不到,输出"I want nobody nobody but you".

样例1

样例输入1

2 1
0 1
2

样例输出1

1

限制

1s

提示

数据范围
对于10%的数据,1<=n<=10,1<=m<=10.
对于100%的数据,1<=n<=200,1<=m<=200.

来源

<Nobody>By Wonder Girls

Why are you trying to, to make me leave you
I know what you're thinking
Baby why aren't you listening
How can I just
Just love someone else and
Forget you completely
When I know you still love me
Telling me you're not good enough
My life with you is just too tough`
You know it's not right so
Just stop and come back boy How can this be
When we were meant to

I want nobody nobody But You, I want nobody nobody But You
How can I be with another, I don't want any other
I want nobody nobody nobody nobody
I want nobody nobody But You, I want nobody nobody But You
How can I be with another, I don't want any other
I want nobody nobody nobody nobody