#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
const int N = 2e5 + 10;
ll aarray[200000 + 10];
ll magic[101][101];
vector<ll> primes;
bool prime[1000001];
int main() {
  ios_base::sync_with_stdio(false);
  string str;
  ll a, b, c, d, e, k, f, x, y, t, A = 1, B = 0, L, j, i, l, r, m, n, C = 0,
                                   ans = 0, sum = 0, sum1 = 0;
  vector<ll> v, v1;
  queue<ll> qu;
  cin >> n >> k;
  if (k == 1) {
    cout << n << endl;
    return 0;
  }
  while (A <= n) {
    A *= 2;
  }
  cout << A - 1 << endl;
  return 0;
}
