// Slower C++ solution:
#include <iostream>

#include <string>

#include <algorithm>

#include <functional>

#include <vector>

#include <stack>

#include <queue>

#include <deque>

#include <set>

#include <map>

#include <cstdio>

#include <cmath>

#include <tuple>

#include <iomanip>

#include <numeric>

#include <unordered_map>

#include <sstream>   

#include<limits.h>

#include<float.h>

#include<list>

#include <array>

#include <complex>

#include<stdio.h>

#include<string.h>



using namespace std;

#define int  long long

 

#define I32_MAX 2147483647

#define I64_MAX 9223372036854775807int

#define I64_MAX2 1223372036854775807int

#define INF I64_MAX2

#define MOD 1000000007

#define MEM_SIZE 10000

#define DEBUG_OUT true

#define ALL(x) (x).begin(),(x).end()

// int DP[MEM_SIZE][MEM_SIZE] = {0};

// int GMEM[MEM_SIZE][MEM_SIZE] = {0};

template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return;std::cout << e << std::endl;}

template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}

template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }

template<class T,class X> void DEBUG(X d, T e){if(DEBUG_OUT == false)return;std::cout <<d<<" ";DEBUG(e);};

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}

template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }





//FUNCTION  

 

//solve



void solve(void)

{

  double N,M;

  cin>>N>>M;

  double X = 1900*M + 100*(N-M);

  double ANS = 0;

  double P = pow(0.5,M);

  double Q = 1-P;

  for (int i = 0; i < 10000; i++)

  {

  ANS += X*(1+i)*P*pow(Q,i);

    // DEBUG(ANS);

  }

  ANS += 0.01;

  cout<<(int)ANS<<endl;

  





  return;

}



int32_t main(int32_t argc, const char *argv[])

{

  std::ios::sync_with_stdio(false);

  std::cin.tie(0);



  std::cout << std::fixed;

  std::cout << std::setprecision(9);

  solve();



  return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.2610552955402912x):
#include <iostream>

#include <string>

#include <algorithm>

#include <functional>

#include <vector>

#include <stack>

#include <queue>

#include <deque>

#include <set>

#include <map>

#include <cstdio>

#include <cmath>

#include <tuple>

#include <iomanip>

#include <numeric>

#include <unordered_map>

#include <sstream>   

#include<limits.h>

#include<float.h>

#include<list>

#include <array>

#include <complex>

#include<stdio.h>

#include<string.h>

#include <bitset>



using namespace std;

#define int  long long

 

#define I32_MAX 2147483647

#define I64_MAX 9223372036854775807LL

#define I64_MAX2 1223372036854775807LL

#define INF I64_MAX2

#define MOD 1000000007

#define MEM_SIZE 10000

#define DEBUG_OUT true

#define ALL(x) (x).begin(),(x).end()



// int DP[MEM_SIZE][MEM_SIZE] = {0};

// int GMEM[MEM_SIZE][MEM_SIZE] = {0};

template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}

template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}

template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }

template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}

template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }





//-----CODE------//

void solve(void)

{

  int N,M;

  cin>>N>>M;

  double ANS = 0;

  double TIME = 1900*M + 100*(N-M);

  double dM = M;

  double P = pow(0.5,M);

  double rP = 1 - P;

  double sP = 1;

  for (int i = 1; i < 10000; i++)

  {

    ANS += TIME*(i)*P*sP;

    sP *= rP;

  }

  cout<<(int)round(ANS)<<endl;

  

  return;

}



int32_t main(int32_t argc, const char *argv[])

{

  std::ios::sync_with_stdio(false);

  std::cin.tie(0);



  std::cout << std::fixed;

  std::cout << std::setprecision(9);

  solve();



  return 0;

}