Help with designing context-free grammar


I am having issues figuring this out.

Design a CFG for a language in which each string is made up of two parts: the first part of the string consists of 0 or more x’s and 0 or more y’s in any order; the second part of the string consists of a number of z’s which is equal to the number of x’s and y’s.