>>> import collections
>>> 
>>> def f(lst1, lst2):
...     c1 = collections.Counter(lst1)
...     c2 = collections.Counter(lst2)
...     inter = set(c1).intersection(c2)
...     out = {k:(c1[k], c2[k]) for k in inter}
...     return out
... 
>>> f([0, 0], [0, 0, 0])
{0: (2, 3)}
>>> f([0, 1], [0, 1, 0])
{0: (1, 2), 1: (1, 1)}
>>> f([1, 2, 3, 1, 2], [1, 2, 5, 1, 4])
{1: (2, 2), 2: (2, 1)}
>>>

>> a = [0, 1, 2, 0, 3, 2]
>> b = [0, 0, 2, 3, 3, 3]
>> c = a + b
>> { k:c.count(k) for k in set(s)}
>> {0: 4, 1: 1, 2: 3, 3: 4}

>>> f = lambda *args: {i: map(lambda x: x.count(i), args) for i in reduce(set.__rand__, map(set, args))}
>>> 
>>> print f([0, 0], [0, 0, 0])
{0: [2, 3]}
>>> print f([0, 1], [0, 1, 0])
{0: [1, 2], 1: [1, 1]}
>>> print f([1, 2, 3, 1, 2], [1, 2, 5, 1, 4])
{1: [2, 2], 2: [2, 1]}
>>> print f([1, 2, 3, 1, 2], [1, 2, 5, 1, 4], [1, 3, 2], [1, 2, 5, 1, 4])
{1: [2, 2, 1, 2], 2: [2, 1, 1, 1]}
>>> print f([1, 2, 3, 1, 2])
{1: [2], 2: [2], 3: [1]}