跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2643. Friends

  • ID: 2649
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 待分类
  • 整理状态
  • 难度待定
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Friends

题目描述

B. Friends
time limit per test
6 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You have n friends and you want to take m pictures of them. Exactly two of your friends should appear in each picture and no two pictures should contain the same pair of your friends. So if you have n=3 friends you can take 3 different pictures, each containing a pair of your friends.

Each of your friends has an attractiveness level which is specified by the integer number ai for the i-th friend. You know that the attractiveness of a picture containing the i-th and the j-th friends is equal to the exclusive-or (xor operation) of integers ai and aj.

You want to take pictures in a way that the total sum of attractiveness of your pictures is maximized. You have to calculate this value. Since the result may not fit in a 32-bit integer number, print it modulo 1000000007 (109+7).

Input

The first line of input contains two integers n and m − the number of friends and the number of pictures that you want to take.

Next line contains n space-separated integers a1,a2,...,an (0≤ai≤109) − the values of attractiveness of the friends.

Output

The only line of output should contain an integer − the optimal total sum of attractiveness of your pictures.

Examples
Input
3 1
1 2 3
Output
3
Input
3 2
1 2 3
Output
5
Input
3 3
1 2 3
Output
6

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2304 题。保留原作者与原赛事署名。