*The problem uses a simplified TCP/IP address model, please make sure you’ve read the statement attentively.*

Polycarpus has found a job, he is a system administrator. One day he came across *n* IP addresses. Each IP address is a 32 bit number, represented as a group of four 8-bit numbers (without leading zeroes), separated by dots. For example, the record 0.255.1.123 shows a correct IP address and records 0.256.1.123 and 0.255.1.01 do not. In this problem an arbitrary group of four 8-bit numbers is a correct IP address.

Having worked as an administrator for some time, Polycarpus learned that if you know the IP address, you can use the subnet mask to get the address of the network that has this IP addess.

The *subnet mask* is an IP address that has the following property: if we write this IP address as a 32 bit string, that it is representable as “11…11000..000”. In other words, the subnet mask first has one or more one bits, and then one or more zero bits (overall there are 32 bits). For example, the IP address 2.0.0.0 is not a correct subnet mask as its 32-bit record looks as 00000010000000000000000000000000.

To get the network address of the IP address, you need to perform the operation of the bitwise “and” of the IP address and the subnet mask. For example, if the subnet mask is 255.192.0.0, and the IP address is 192.168.1.2, then the network address equals 192.128.0.0. In the bitwise “and” the result has a bit that equals 1 if and only if both operands have corresponding bits equal to one.

Now Polycarpus wants to find all networks to which his IP addresses belong. Unfortunately, Polycarpus lost subnet mask. Fortunately, Polycarpus remembers that his IP addresses belonged to exactly *k* distinct networks. Help Polycarpus find the subnet mask, such that his IP addresses will belong to exactly *k* distinct networks. If there are several such subnet masks, find the one whose bit record contains the least number of ones. If such subnet mask do not exist, say so.

**Input**

The first line contains two integers, *n* and *k* (1 ≤ *k* ≤ *n* ≤ 10^{5}) — the number of IP addresses and networks. The next *n* lines contain the IP addresses. It is guaranteed that all IP addresses are distinct.

**Output**

In a single line print the IP address of the subnet mask in the format that is described in the statement, if the required subnet mask exists. Otherwise, print -1.

**Examples**

input

5 3

0.0.0.1

0.1.1.2

0.0.2.1

0.1.1.0

0.0.2.3

output

255.255.254.0

input

5 2

0.0.0.1

0.1.1.2

0.0.2.1

0.1.1.0

0.0.2.3

output

255.255.0.0

input

2 1

255.0.0.1

0.0.0.2

output

-1

**Solution:**

#include <cstring> #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> using namespace std; unsigned int a[111111]; int main() { int n, k; scanf("%d %d", &n, &k); for (int i=0;i<n;i++) { int x[4]; scanf("%d.%d.%d.%d", x+0, x+1, x+2, x+3); a[i] = 0; for (int j=0;j<4;j++) for (int p=7;p>=0;p--) { a[i] <<= 1; if (x[j] & (1 << p)) a[i]++; } } sort(a, a+n); unsigned int mask = 0; for (int z=1;z<=31;z++) { mask += (1LL << (32-z)); int nets = 1; for (int i=0;i<n-1;i++) if ((a[i] & mask) != (a[i+1] & mask)) nets++; if (nets == k) { printf("%d.%d.%d.%d\n", mask >> 24, (mask >> 16) & 255, (mask >> 8) & 255, mask & 255); return 0; } } printf("%d\n", -1); return 0; }