1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <cstdio>
#include <string.h>
#include <math.h>
#include <thread>
#include <chrono>
#include <string>
#include <vector>

using namespace std;

//int Conv(vector<int> vect) {
//
//	
//
//
//	return count;
//}


void print(std::vector<int> input)
{
	for (int i = 0; i < input.size(); i++) {
		std::cout << input.at(i) << ' ';
	}
}


int main() {

	int n, m;

	int result = 0;


	cin >> n >> m;


	vector<int> sec;

	for (int i = 0; i < n; i++)
	{
		int input;

		cin >> input;

		sec.push_back(input);

	}


	vector<int> opt_beats;
	int q = 0;

	if (m > n - 1)
	{
		

		for (int i = n; i <= m; i++)
		{

			opt_beats.push_back(i);
			q++;

		}

	}
	else if (m = n - 1)
	{

		for (int i = n; i <= m; i++)
		{

			opt_beats.push_back(i);
			q++;

		}

	}

	



	for (int i = 0; i < q; i++)
	{
		int num = opt_beats[i];


		vector<int> bin;

		int count = 0;


		for (int i = 0; num > 0; i++)
		{
			bin.push_back(num % 2);
			num /= 2;

		}

		for (int i = bin.size() - 1; i >= 0; i--)
		{
			if (bin.at(i) == 1) {

				count += 1;

			}
		}


		result += sec[i] * count;

	}

	
		cout << result << endl;
	
	

}