#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e9 + 9;
int cal(int j) {
  int sum1 = ((j) * (j - 1)) / 2;
  return (sum1);
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
  int result = arr[0];
  for (int i = 1; i < n; i++) {
    result = gcd(arr[i], result);
    if (result == 1) {
      return 1;
    }
  }
  return result;
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
bool isPrime(int n) {
  if (n <= 1) return false;
  for (int i = 2; i < n; i++)
    if (n % i == 0) return false;
  return true;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool checkme(char a, char b, char c) {
  if (a == c || b == c) {
    return (true);
  }
  return (false);
}
int maxi(int a, int b, int c) {
  int ma = max(a, b);
  return (max(ma, c));
}
void mycode() {
  long long a, b;
  cin >> a >> b;
  cout << "YES" << endl;
  long long i = a;
  while (i < b) {
    cout << i << " " << i + 1 << endl;
    i = i + 2;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) {
    mycode();
  }
  return 0;
}
