English: So, everything that needs to be hashed is one out of this m, so very common example of hashing is that if there are h locations, there is a k mod m. So, any key gives you a number, once you take a modulus according to m, gives you a number between 0 to m - 1 which is what, where the key is stored or the contents corresponding to the key are stored.
Telugu: కాబట్టి, హ్యాష్ చేయవలసిన ప్రతిదీ ఈ m లో ఒకటి, హాషింగ్‌కు చాలా సాధారణ ఉదాహరణ ఏమిటంటే h స్థానాలు ఉంటే, ఒక k mod m ఉంది.