Relationship between deterministic finite automata languages

What does this "⊃" superset mean? What should I prove here? Can any one, please, explain in English?
Should I make a cross product?
Moreover, in textbooks and online, I only see "∩" "∪" these symbols a little bit. What does this symbol "⊃" mean?

Let M = (K, Σ, δ, s, F) be a deterministic finite automaton. Let M =
(K, Σ, δ, s, F) is a similar deterministic finite automaton where F is
A voucher
subset of F & # 39; For each of the following, provide an example showing that
relationship between L (M) and L (M & # 39;) is possible or explain why the
it is not possible.

The problem to prove: L (M) L (M & # 39;)