// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

//input output
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}
use std::io::BufRead;

const MOD: u64 = 998244353;

fn floor_sqrt(n: u64) -> u64 {
    if n == 0 || n == 1 {
        return n;
    }
    let mut left = 0;
    let mut right = n;
    let mut ans = 0;
    while left <= right {
        let mid = left + (right - left) / 2;
        if mid > 0 && mid > n / mid {
            // Prevent overflow
            right = mid - 1;
        } else {
            if mid * mid <= n {
                ans = mid;
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
    }
    ans
}

fn main() {
    let (n, m) = readuu();
    let N = n as u64;
    let M = m as u64;
    let K_limit = floor_sqrt(M);
    let k_max = if K_limit < N { K_limit } else { N };
    let mut sum_k_floor_Mk: u128 = 0;
    //愚直＋主客転倒
    for k in 1..=k_max {
        let q = M / k;
        sum_k_floor_Mk += (k as u128) * (q as u128);
    }

    let q_max = if K_limit + 1 > 0 {
        M / (K_limit + 1)
    } else {
        0
    };
    for q in 1..=q_max {
        let mut l = (M / (q + 1)) + 1;
        let mut r = M / q;
        if l < K_limit + 1 {
            l = K_limit + 1;
        }
        if r > N {
            r = N;
        }
        if l > r {
            continue;
        }
        let count = r - l + 1;
        let sum_k = ((l as u128) + (r as u128)) * (count as u128) / 2;
        sum_k_floor_Mk += (q as u128) * sum_k;
    }

    let total = (M as u128) * (N as u128);
    let sum = total.wrapping_sub(sum_k_floor_Mk);
    let result = (sum % (MOD as u128)) as u64;

    println!("{}", result);
}